2. Recall the language: LONG-PATH-(G, k | k is an integer; G is an undirected graph with a simple path of length k) Suppose there exists an efficient algorithm ALG that decides LONG-PATH. Devise an eli cient algorithm which, given an undirected graph G, finds the longest simple path in G