The path problem for directed graphs is defined as below:

Given a connected directed graph G and two nodes i, j. Is there a path from node I to node j?

The path with fixed node problem for directed graphs is defined as below:

Given a connected directed graph G, and three nodes i, j, k. Is there a path from node I to node j that passes through node k?

Assume that the path problem is decidable. Define a reduction to prove that the path with fixed node problem is also decidable?