PART B PLEASE PROVIDE PSEUDO

$($a$)$ Which is faster Code A or Code B$?$ Explain why?

#include $i,jB[j^{**}n+i]=A[i^{**}n+j]$;$f=$max$(x,0)\left[\begin{array}{c}{y}_0\\ \text{v}\text{d}\text{o}\text{t}\text{s}\\ y_n\end{array}\right]=f(\left[\begin{array}{ccc}{w}_{00}& \text{c}\text{d}\text{o}\text{t}\text{s}& w_{0m}\\ \text{v}\text{d}\text{o}\text{t}\text{s}& \text{d}\text{d}\text{o}\text{t}\text{s}& \text{v}\text{d}\text{o}\text{t}\text{s}\\ w_{n0}& \text{c}\text{d}\text{o}\text{t}\text{s}& w_{nm}\end{array}\right]\left[\begin{array}{c}{x}_0\\ \text{v}\text{d}\text{o}\text{t}\text{s}\\ x_m\end{array}\right])(j=0$;$j$

$B[j^{**}n+i]=A[i^{**}n+j]$;

$\}(i=0$;$i$

for $(j=0$;$j$

$B[j^{**}n+i]=A[i^{**}n+j]$;

$\}\}$