A program P running on a single-processor system takes time T to complete. Let us assume that 40% of the programâs code is associated with "data management housekeeping" (according to Amdahl) and, therefore, can only execute sequentially on a single processor. Let us further assume that the rest of the program (60%) is "embarrassingly parallel" in that it can easily be divided into smaller tasks executing concurrently across multiple processors (without any interdependencies or communications among the tasks). 1. Calculate T2, T4 and T8, which are the times to execute Program P on a two-, four-, eight-, processor system, respectively.2. Calculate T[infinity] on an system with an infinite number of processors. Calculate the speedup of the program on this system, where speedup is defined as T/T[infinity]. What does this correspond to?