The matrix alignment problem $($MA$)$ accepts two square matrices $A($size

$mm$ and size $nn$ containing positive integers, where $mn,$ and

it outputs a row and column i and $j$ so that positioning $A[0,0]$ over $B[i,j],$

multiplying the overlapped numbers, and adding the products gives the

largest possible sum. For example, if we consider the problem where

$A=\left[\begin{array}{cc}1& 2\\ 2& 1\end{array}\right],$ and $,B=\left[\begin{array}{ccc}3& 1& 4\\ 2& 2& 5\\ 6& 1& 3\end{array}\right],$

The four most likely solutions are $(i,j)=(0,0),(0,1),(1,0),$ and $(1,1),$

which yield product$-$sums of:

Note that it is possible to choose "misalignments" like $(i,j)=(0,-1)$ or

$(0,2)$; however, all values of $B$ that are out of bounds are considered to

be $0.$ For this problem, the optimum alignment is $i=1$ and $j=0,$ with

a value of $19.$

Give pseudocode for a greedy algorithm to solve MA$.$ Your algorithm must

be greedy, though it does not need to be correct.