Please answer the following questions in the attached image (Course: discrete structures and combination analysis) :

not, specify which property of one graph is not preserved in the other. The above guen grapts are isomorfhic: But they dond have the same number of verdicest edger i.e 7 \& 9 resfrechierly. They also have some: 4 vertices of degree 2 3 verticu of degree 1 . Houcever, the Graphs are somorphie becays f(H)=C; there in one to one corresfondance betwen a&H. 9. (3 marks) Either give an example or prove that there are none: a) A simple undirected graph whose vertices have degrees 2,3,4,4,4. b) A simple directed graph whose vertices have indegrees 0,2,3,3,4 and outdegrees 0,3,3,3,3. (Note: the order of vertices in the two lists is not necessarily the same.) a) Not Possible. b) deg(a)=0,deg(b)=3,deg(c)=3deg(d)=2 deg+(a)=0,deg+(b)=2,deg(c)=3 dog+(e)=4 Nol possible