Isomorphism and Subgraphs · Easy problem

Let $G$ have vertices $1,\ldots,5$ and edges $12,13,23,34,45$. Let $H$ have the same vertices and only the edges $12,34,45$, so $H$ is a spanning subgraph of $G$. How many edges must be added to $H$ to recover all of $G$?