7) (20 pts) Running times. Each question has 2pts. A. Can be solved in linear time in the worst case. B. Can be solved in polynomial time in the worst case. C. Can be solved in exponential time in the worst case. D. Cannot be solved/computed with any algorithm Match each task below with the best-matching description above. For the pur- poses of this question, assume PNP Find strongly connected components in a graph. _ Find a longest path from s to t in an edge-weighted graph. Construct a DFA corresponding to a pattern. Given a set N of integers and an integer t, determine a subset Sc N such that the sum of the numbers in S equals to t. Find the maximum clique on a graph. Find an MST on a graph. Compute a maximum s-t flow in a flow network using the Ford- Fulkerson algorithm with the shortest augmenting path rule. Compute a maximum s-t flow in a flow network using linear program- ming Load balancing with 2 machines. Find whether one can color a graph with 3 colors such that adjacent ver- tices must have different colors