Extracted text: Let a graph have vertices M, N, O, P, Q, R, S and edge set {{M,R}, {N,O},{0, S}, {P, R}, {Q, R}, {R, S}} a. What is the degree of vertex M ? b. What is the degree of vertex O? c. How many components does the graph have?
Extracted text: ng wrong WILT Construct a simple graph that is a forest with vertices B, C, D, E, F,G such that the degree of D is 2 and there are 2 components. What is the edge set? {DB,DC,EF,EG}|