BELOW IS THE QUESTION AND TWO CODES THAT WERE PROVIDED TO HELP. PLEASE USE AS MUCH AS YOU CAN OF THE PROVIDED CODE. TRY TO KEEP THE CONCEPTS SIMPLE AND USE MULTIPLE THREADS IF NEEDED. MAYBE 5 OR 6.

5. Given the serial run-time of a program Tserial = 30 seconds, and assume that we can parallelize 80% of this program find Tparallel for 1, 3, 6 processors and draw the Tparallel vs. processor graph. Explain what happens if the processor number goes to infinitive in terms of efficiency and speedups. (20 points) Enter rows and columns for first matrix: 2 2 Enter rows and columns for second matrix: 2 2 Enter elements of matrix 1: Enter element a11 : 1 Enter element a12 : 2 Enter element a21 : 3 Enter element a22 : 4 Enter elements of matrix 2: Enter element b11 : 4 Enter element b12 : 3 Enter element b21 : 2 Enter element b22 : 1 Output Matrix: 85 20 13 #include #include using namespace std; // This program finds the sum of numbers from 0-100 with 11 variable p number of threads int global_sum = @; int N = 101; const int P = 5; void myThreadMethod( int id) { int local_sum = %; int mystart. - id * N/P int myend - (id + 1) * N/P for (int i = mystart; i join(); } cout #include using namespace std; // This program finds the sum of numbers from 0-100 with 11 variable p number of threads int global_sum = @; int N = 101; const int P = 5; void myThreadMethod( int id) { int local_sum = %; int mystart. - id * N/P int myend - (id + 1) * N/P for (int i = mystart; i join(); } cout