Assume that you are a production manager in a factory that produces fresh orange juice. On any given day, you receive multiple shipments of oranges which we may represent as S1, S2, 3w Sn (Sn represents the number of oranges in each shipment). To preserve the freshness of the orange juice, the oranges must be processed in the sequence that they are received je. S1, S2, S3. You may assume that the shipment of oranges is received before the factory production starts. The shipment of oranges received must be used/processed within the same day. The oranges may not be stored and processed the following day. This means that unused oranges are discarded. Your factory produces several batches of orange juice in a day. Each batch is labelled according to its date and time of production which we may represent as B1, B2, B3ww Bo (Bo represents the date and time of production). Note that there is only d litres of orange juice that may be produced in each batch. Further, due to machinery and manpower constraints, only 6 batches of orange juice may be produced on any given day. Each shipment of oranges may only be used to produce one batch of orange juice ie, one shipment of oranges may not be split across batches. This is to preserve the freshness of the orange juice and to track the shipment of oranges used in each batch. On certain days, there may be shipments of oranges that may need to be prioritized for processing in order to preserve its freshness. Your task is to plan the daily processing of oranges into orange juice with the aim of optimising the number of times the production line has to operate in a day (ie, the number of batches of orange juice). Propose an efficient algorithm that will produce an optimal solution for this problem. Use a areedy colution for this problem Samole Innut: The Ucer chould be allowed to innut the following