Compute the total computing time $T(n)$ of the following algorithm and express it in $O$

notation. $(n$ is the size of input

a$)$ count $=0$;

for $(i=1$;$iN$;$i++$

for $(j=1$;$jM$;$j++)$

for $(j=1$;$jK$;$j++$

count$++$;