Consider the following graph.
On the diagram above, make this a connected graph, using the smallest number of edges. (2 marks)
--- 0 WORK AREA LINES (style=lined) ---
Show Answers Only
`text{Any addition of 3 edges that connects all vertices.}`
Show Worked Solution
`text{Any addition of 3 edges that connects all vertices.}`