I'd like you to fill in a function, recursive vertex cover, that takes an input graph, which is a list of lists, and an assignment, which is a list of vertices that we cover and then builds the search tree from that. 