P2) [(10 pts.) Greedy] You are given a sequence of n songs where the ith song is l minutes long. You want to place all of the songs on an ordered series of CDs (e.g. CD1, CD2, CD3,. .. ,CDK) where each CD can hold m minutes. Furthermore, (1) The songs must be recorded in the given order, song 1, song 2,. ... , song n. (2) All songs must be included. (3) No songs may be split across CDs. Your goal is to determine how to place the songs on the CDs so as to minimize the number of CDs needed. Describe an efficient Greedy algorithm to find an optimal solution to this problem. Explain your approach