Help me here /sci/
I aced trees but for the love of god graphs got me all tangled up.

Consider the directed acyclic graph G = (V, E). Assume |V | ? 5.
Prove the following claim: It is possible to add |V | directed edges to G without introducing a cycle (and without introducing new vertices).