Question 4 (20%) Give an example or prove that there are non for a simple graph: a) h 6 vertices, whose degrees are 2,2,2,3,4,4 b) 8 vertices, whose degrees are 0,1,2,3,4,5,6,7. c) th degrees 1,2,2,3. d) ith degrees 2,3,4,4,4. e th degrees 1,1,2,4 (10 marks) A game consisting of flipping a coin ends when the player gets two heads in a row, two tails in a row, or flips the coin four times: a) Draw a tree diagram to show the ways in which the game can end. b) In how many ways can the game end? (10 marks)