Consider the problem of finding the longest strictly increasing subsequence of a sequence of n numbers x1, x2, . . . , xn. Example: for the numbers 132545, 135 is a strictly increasing subsequence (not necessarily the longest). (a) How can we view this as finding a longest or shortest path in a DAG? Which one - longest or shortest? Draw a picture for the above example for part of the above example. (b) What are the nodes of the DAG? (c) What are the edges and edge weights?