Prove that each of following problems is in P by sketching a polynomial time algorithm that solves it. Briefly justify that your algorithm runs in polynomial.

(4) SPATH = {G,s,t,k | G is an undirected graph with a simple path from s to t with length at most k}