Design and implement (using C++) a greedy algorithm to solve the problem presented in exercise 6 on page 191 of the textbook.

Design and implement (using C++) a greedy algorithm to solve the problem presented in exercise 6 on page 191 of the textbook. If you can't figure out the optimal greedy policy, implement any policy and you'll get partial credit. Extra credit will be given if you can prove that your policy is optimal (the proof is similar to one of the proofs of the 3 schedule problems covered in class). Finally, you may use the following example in your code.Example: Given 7 participants with the times shown below, your algorithm should return a schedule whose completion time is 122:s_i b_i r_i1 15 13 152 19 17 133 10 16 194 12 18 175 18 13 146 15 10 147 10 13 10