) What is the minimum cost of reaching location (m,n) (note that m,n 0) starting from location (0,0) in the above city? Describe one possible path achieving the minimum cost. Is it unique (i.e., are there multiple paths that achieve the minimum cost)