(10 points) For the DFG below, assume each multiplication takes 2 units of time and each addition takes 1 unit of time. The costs for a multiplier and an adder are 4 and 2, respectively. The clock period is T = 5. Please use force directed algorithm to find the min-cost scheduling solution. (10 points) This a change of the first problem. Suppose only one multiplier and only one adder are available. Please use the list scheduling algorithm to find a scheduling solution such that the maximum delay from s to t is minimized. Please note there is no clock period constraint. (10 points) For the DFG below, assume each multiplication takes 2 units of time and each addition takes 1 unit of time. The costs for a multiplier and an adder are 4 and 2, respectively. The clock period is T = 5. Please use force directed algorithm to find the min-cost scheduling solution. (10 points) This a change of the first problem. Suppose only one multiplier and only one adder are available. Please use the list scheduling algorithm to find a scheduling solution such that the maximum delay from s to t is minimized. Please note there is no clock period constraint