Which of the following statements is true for the algorithm below,

ALGORITHM MatrixMultiplication$($A$[0..$n$-1,0..$n$-1].$ B$[0..$n$-1,0..$n$-1])$

$//$Multiplies two square matrices of order $n$ by the definition$-$based algorithm

$//$Input: Two $nn$ matrices A and $B$

$//$Output: Matrix $C=AB$

for ilarr$0ton-1do$

for jlarr$0ton-1do$

$q,C[i,j]larr0\mathrm{.}0$

for klarr$0ton-1do$

$,C[i,j]larrC[i,j]+A[i,k]**B[k,j]$

return $C$

return $C$

a$.$ The worst case complexity is $O(n^2)$

b$.$ The best case complexity is $O(n^3)$

c$.$ The best case complexity is $O(1)$

d$.$ The worst case complexity is $O(n)$

$5.n^2$inO$(n^3)$

a$.$ True

b$.$ False