No what’s your problem on edge
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 .
<em>Answer:</em>
<em>One of the first and main steps in protecting your email is to have a </em><em><u>URL</u></em><em> filtering system.</em>
