Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
I’m pretty sure is false as well because of the first person has told u <3
Answer:
i think its accommodate, because the other two dont look right. correct me if im wrong
Answer:
D
Explanation:
Home page will not usually be formatted the same as the contact page because each page has a different purpose
Answer:
post them, but id say anything with personal information
