please answer both parts below

Question) We considered a program before with P% of the instructions parallelizable and calculated the performance of an N-processor system running this program (assuming zero communication overhead). e.g. relative performance of an N- processor system vs. a single processor system The program execution time on N processors (using Amdahls law): T_N = (P%/N + (1-P%)) T Relative performance: T / T_N = 1 / (P%/N + (1-P%)) Now if we further scale the system to 2N processors (still assuming zero communication overhead), please discuss the relative performance (i.e., speedup) of 2N-processor vs. N-processor using the following two methods. Please explain and justify your answers below:

(a) Strong scaling (i.e., assuming fixed workload when analyzing the two systems);

(b) Weak scaling (i.e., assuming the workload of the parallelizable part grows proportionally to the increase in the number of processors).