WeBWorK Standalone Renderer

Construct a connected bipartite graph that is not a tree with vertices ${M, N, O, P, Q}$ .

What is the edge set?

Construct a bipartite graph with vertices ${M, N, O, P, Q}$ such that the degree of $P$ is 3.

What is the edge set?

You can earn partial credit on this problem.