1. Given a grid of integers (positive or negative), give a dynamic programming algorithm that will determine the minimum sum of all numbers in a path (without repeats) from the upper left corner to the lower right corner, where you are allowed to move down, right, and up.

2. Give an O(n 2 )-time algorithm to find the longest monotonically increasing subsequence of a sequence of n numbers.