Question $2[12$ marks$]$: A factory produces custom widgets according to customer requirements. It has several orders, each for a single widget. For each order, we know the following information: i$)$ The profit that the factory will make from the order. ii$)$ The deadline $-$ the last day on which the customer will accept delivery. The factory can make exactly one widget per day. The following table shows all the orders for a $6-$day period: Order No$.12345678910$ Profit $102090405010070803060$ Deadline $6613412434.$ Use Greedy Approach to determine the orders that the factory should accept for achieving the highest profit, and the schedule for producing the widgets of the accepted orders. Question $2[12$ marks$]$: A factory produces custom widgets according to customer requirements. It has several orders, each for a single widget. For each order, we know the following information: i$)$ The profit that the factory will make from the order. ii$)$ The deadline $-$ the last day on which the customer will accept delivery. The factory can make exactly one widget per day. The following table shows all the orders for a $6-$day period: Use Greedy Approach to determine the orders that the factory should accept for achieving the highest profit, and the schedule for producing the widgets of the accepted orders.