1. The single-destination shortest path problem for a directed graph is to find the shortest path from every other vertex to a specified vertex destV. Give an efficient algorithm (pseudo code) to solve the single-destination shortest paths problem.
2. ) Use pure dynamic programming (no variable reuse) to compute the following Fibonacci-like function: f(n) = f(n-1) + 2f(n-2) + f(n-3). Analyze the corresponding time complexity (show your work) and then investigate a more efficient implementation.
3. Design a BFS-based algorithm (pseudo code) for directed graph that computes the total number of paths from vertex srcU to vertex destV.