Problem 4: The LONG PATH problem is as follows: Suppose you are given an undirected, unweighted graph, specified nodes s and t, and an integer b. We want to design an algorithm that finds a simple path of length b or greater in this graph, beginning at s and ending at t. (A simple path is a graph with no repeated nodes or edges). It does not matter where the path starts or ends. Show that this problem is NP-complete. Hint: Which NP-complete problems did we see in class? Are any of thenm similar to this? If we know that some other problem is NP-complete, how do we use that to show that the current problem is NP-complete? Problem 4: The LONG PATH problem is as follows: Suppose you are given an undirected, unweighted graph, specified nodes s and t, and an integer b. We want to design an algorithm that finds a simple path of length b or greater in this graph, beginning at s and ending at t. (A simple path is a graph with no repeated nodes or edges). It does not matter where the path starts or ends. Show that this problem is NP-complete. Hint: Which NP-complete problems did we see in class? Are any of thenm similar to this? If we know that some other problem is NP-complete, how do we use that to show that the current problem is NP-complete