Given an n x m grid filled with non-negative numbers, find the minimal sum of all numbers along a path from top left (1, 1) to bottom right (n,m). You can only move either down (i) or right (j) at any point in time. Find an algorithmically efficient solution. What is the running time of your algorithm