There are n cities connected by some number of flights. You are given an array of flights F[1, . . . , n], where F[i] = (From i , To i , p i ) indicates that there is a flight from city From i to city...

There are n cities connected by some number of flights. You are given an array of flights F[1, . . . , n], where F[i] = (From_i, To_i, p_i) indicates that there is a flight from city From_i
to city To_i
with cost p_i. You are also given three integers src, dst, and k, return the cheapest price from city src to city dst with at most k stops. If there is no such route, return -1.

Precisely define the subproblem.
Provide the recurrence equation.
Describe the algorithm in pseudocode to compute the optimal value.
Describe the algorithm in pseudocode to print out an optimal solution.