Problem:
Question 1: Under what conditions is an edge in a connected graph G contained in every spanning tree of G?
Question 2: Write code to accomplish each of the following:
1.Declare a structure, Automobile, with the following members:
2.model - string of 25 characters maximumyear -
a) integer mpg
b) double
3. Declare variable car to be of type struct Automobile
4. Declare an array, vehicle, of 500 Automobiles
5. Declare variable ptr to be of type pointer to struct Automobile
6. read a model, year, and mpg from the keyboard into the proper members of variable car
Show the code, demonstrate it works properly and describe what it is doing.