6. For the same processor as problem 4, answer the same questions for the following C code. int N = 1000; int A[N] [N], B[N] int i, j; for (i=0; i< N; i++) { int temp = 0; for (j=0; j < N; j++) { temp = A[i][j] * B[j] } C[i] temp; Instruction class CPI #instructions x10 1 add mul load/store branch 222 Total Cycles x10 Cycles Percentage

c) Estimate the time complexity for the following C++ program: //IIIII// Start //////////// #include void BSort(int A[n][n]) { int temp; for(int j=0 ; j A[i+1]) { const int n=10; int Fact (int); void BSort(int A[n][n]); int main() { int A[n][n]; for(int i=0;i>A[i][j]; temp=A[i]; A[i]=A[i+1]; A[i+1]=temp; } } BSort(A); cout<<"Factorial = "<