$\%$ Step $1$: Handle negative or non$-$integer inputs if sizeOfTable $<0$ sizeOfTable $=$ abs$($sizeOfTable$)$; $\%$ Take the absolute value if negative end sizeOfTable $=$ ceil$($sizeOfTable$)$; $\%$ Round up if it's not an integer $\%$ Step $2$: Initialize an empty matrix of the required size outputMatrix $=$ zeros$($sizeOfTable$,$ sizeOfTable$)$; $\%$ Preallocate matrix for efficiency $\%$ Step $3$: Fill the matrix using nested while loops i $=1$; $\%$ Initialize row index while i $<=$ sizeOfTable j $=1$; $\%$ Initialize column index for each row while j $<=$ sizeOfTable outputMatrix$($i$,$ j$)=$ i $*$ j; $\%$ Calculate the product and store it j $=$ j $+1$; $\%$ Move to the next column end i $=$ i $+1$; $\%$ Move to the next row end end