For the remaining questions suppose that you are given an (mn) matrix of integers. - Taking a step in this matrix consists of traveling from a cell in column i to an adjacent (horizontal or diagonal) cell in column (i+1) : The first and last rows (rows 1 and m ) of the matrix are considered adjacent, i.e., the matrix "wraps" so that it represents a horizontal cylinder. - A path in this matrix comprises a sequence of contiguous steps from anywhere in the first column to anywhere in the last column. The weight of a path is the sum of the integers in the cells that the path traverses see this example (43) matrix: You seek to determine the shortest path -the path of minimum weight- in the given matrix. Qn 2. What is the total number of distinct paths in an (mn) matrix? Qn 3. What is the largest number of distinct shortest paths in an (mn) matrix