What is the asymptotic worst case complexity of the given pseudo code for(i=0;i { for(j=0;j { c[i][j]=0; for(k=0;k { c[i][j]=c[i][j]+a[i][k]*b[k][j]; } } }

What is the asymptotic worst case complexity of the given pseudo code

1.	What is the asymptotic worst case complexity of the given pseudo code for(i=0;i { for(j=0;j { c[i][j]=0; for(k=0;k { c[i][j]=c[i][j]+a[i][k]*b[k][j]; } } }
A.	O(n)
B.	O(1)
C.	O(n^2
D.	O(n^3)
Answer» E.