Compatible intervals Given n open intervals (a1, b1), (a2, b2), . . . , (an, bn) on the real line, each representing start and end times of some activity requiring the same resource, the task is to find the largest number of these intervals so that no two of them overlap. Investigate the three greedy algorithms based on a. earlieststartfirst. b. shortest duration first. c. earliestfinishfirst. For each of the three algorithms, either prove that the algorithm always yields an optimal solution or give a counterexample showing this not to be the case.5. Bridge crossing revisited Consider the generalization of the bridge crossing puzzle (Problem 2 in Exercises 1.2) in which we have n > 1 people

Ithink you go to your settings

Through the process of sedimentation,sediment is turned back to rock to form sedimentation.the process of sedimentation is: > deposition-where fragments were deposited into the river or sea under gravity or travelling agent such as wind or water. > sedimentation-the fragments deposited in the river sedimented and accumulate> compaction-the layers of fragments deposited undergoes compaction due to the weight if the upper layers> cementation-chemical substance of the fragments such as cement dissolved into the water and cement the other fragments together to form sedimentary rock.thus,cementation and compaction are the process.on the other hand, transformation only occur when a rock under goes metamorphism(compaction or extreme heat).while recrystillization occurs when a rock is melted and cooled down,which also requires metamorphism to take place.hope it !

Answerthe arguments to the method

Answerhot fixes