Problem 1- Dynamic power management Assume the following power state graph and the energy transitions as follow: - Energy transition from run to idle state: 1mJ (from idle to run: 5mJ ) - Energy transition from run to sleep state: 3mJ (from sleep to run: 10mJ ) - Energy transition from idle to sleep state: 5uJ power states a) Compute the break-even time (Tbe) for each transition from high power to low power states in this power state graph. b) A periodic task with period 300msec is being executed on the processor. The execution time of each job is 100msec. Show that if processor can go to idle or sleep states between the arrivals of the jobs of the task and which state transition can give the minimum energy