Phase 1

1. Develop an algorithm/program to construct a connected graph on v vertices

and e edges, where v and e are parameters and execute your

algorithm/program and depict the results. Program's input and output are as

follows:

Inputs:

o v: number of vertices

o e: number of edges

Outputs:

o Constructed graph (Show the constructed graph as an adjacency list in

an appropriate manner)

o Running time for the algorithm