Problem 2. (20 POINTS) We have an SMP system with two processors. There are three programs P.B.Pto be executed. All of them are CPU-bound (i.e. no I/O and only minimal non-interfering memory interaction). They have runtimes of 5, 15, and 20 sec respectively. Explore possible scheduling scenarios by stating the possible and different elapsed times. For example in one scenario, P1, P3 run one one processor one after the other and on the other one. The elapsed time would be 25. (No need for two scenarios or scenaria if processor 0 gets Bor 1 get B.)