Draw two columns on a piece of paper. Write the 29 at the top of one column and 13 at the top of the other. Now, half the entry in the first column, and write it down on the next row, discarding any remainder. Then double the entry in the second column and write that down too. Repeat the previous step until you get a 1 in the left column. Strike through all the rows where the element in the left column is even. Add up the all those elements in the right column that remain. The result of that sum is the product of 29 and 13: 13 + 52 + 104 + 208 = 377 Write a Haskell function called myMult that uses this approach to compute the product of its two inputs. It should do this by building a list of pairs (for each row) through a recursive process, and summing up the appropriate entries. myMult :: (Integral a) => a -> a -> a Draw two columns on a piece of paper. Write the 29 at the top of one column and 13 at the top of the other. Now, half the entry in the first column, and write it down on the next row, discarding any remainder. Then double the entry in the second column and write that down too. Repeat the previous step until you get a 1 in the left column. Strike through all the rows where the element in the left column is even. Add up the all those elements in the right column that remain. The result of that sum is the product of 29 and 13: 13 + 52 + 104 + 208 = 377 Write a Haskell function called myMult that uses this approach to compute the product of its two inputs. It should do this by building a list of pairs (for each row) through a recursive process, and summing up the appropriate entries. myMult :: (Integral a) => a -> a -> a