Assume you are given a set of n activities that wish to use a resource, and that each activity takes unit time. At any instance t = 1,2 , only one activity can use the resource. Assume that activity, i = 1 n, earns a profit of pi if and only if it is executed no later than time fi (no profit is earned if activity i is executed after f). The goal is to execute a set of activities that maximizes profit. Discuss how this problem possesses the elements necessary for a greedy solution, and prove that the greedy solution is optimal. Provide a detailed description of a solution that solves this problem as efficiently as possible. Assume you are given a set of n activities that wish to use a resource, and that each activity takes unit time. At any instance t = 1,2 , only one activity can use the resource. Assume that activity, i = 1 n, earns a profit of pi if and only if it is executed no later than time fi (no profit is earned if activity i is executed after f). The goal is to execute a set of activities that maximizes profit. Discuss how this problem possesses the elements necessary for a greedy solution, and prove that the greedy solution is optimal. Provide a detailed description of a solution that solves this problem as efficiently as possible