Dynamic Programming

The Fibonacci sequence is the sequence of integers

Which of the following procedure is suitable to find the longest path from a given vertex to any other given vertex in a directed acyclic graph (weighted) with few negative edge weights.

Consider the following two sequences :

X = < B, C, D, C, A, B, C >, and

Y = < C, A, D, B, C, B >

The length of longest common subsequence of X and Y is :

Which of the following algorithms solves the all pair shortest path problem?