Question

int main(){int a[10][10],b[10][10],mul[10][10],r,c,i,j,k;system("cls");printf("enter the number of row=");scanf("%d",&r);printf("enter the number of column=");scanf("%d",&c);printf("enter the first matrix element=\n");for(i=0;i{for(j=0;j{scanf("%d",&a[i][j]);}}printf("enter the second matrix element=\n");for(i=0;i{for(j=0;j{scanf("%d",&b[i][j]);}}printf("multiply of the matrix=\n");for(i=0;i{for(j=0;j{mul[i][j]=0;for(k=0;k{mul[i][j]+=a[i][k]*b[k][j];}}}//for printing resultfor(i=0;i{for(j=0;j{printf("%d\t",mul[i][j]);}printf("\n");}return 0;}Write the test case for branch, path coverage and complexity through garph.
​

Answer 1

Answer:

please mark me brainlist and follow me in brainly then I will surely answer to your question mate

Explanation:

what is the question?