$1.15$ points$)$ Giving the pseudocode, estimate its running time complexity.

$$

a$)$

for $($ i $=0$; i $<$ N; i$++)\{$

$$ for $($ j $=0$; j $<$ N; j$++)\{$

$$for $($ k $=0$; k $<$ N; k$++)\{$

$$ statement;

$\}$

$\}$

$\}$

$$

$$

b$)$

for $($ i $=0$; i $<$ N; i$++)\{$

$$ for $($ j $=0$; j $<$ N; j$++)\{$

$$ statement;

$\}$

$\}$

for $($ k $=0$; k $<$ N; k$++)\{$

$$ statement;

$\}$

$$

$$

c$)$

while $($ low $<=$ high $)\{$

$$ mid $=($ low $+$ high $)/2$;

$$ if $($ target $<$ list$[$mid$])$

$$ high $=$ mid $-1$;

$$ else if $($ target $>$ list$[$mid$])$

$$ low $=$ mid $+1$;

$$ else break;

$\}$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$

$$