Please provide solution for each part asap to get a upvote

6. Show that if G is a connected, undirected graph with a vertices and n - 1 edges, then G is a tree. (Hint: try a proof by contradiction. You may use results that were previously proven in this class.) 7. Solve the n-queens problem with n = 5