Please help me with these two problems!! Thanks for any and all help!!

5. The question concerns the algorithm to find an lerian circuit in an eulerian digraph. Consider digraph with nodes z a s, and 6, and the following arus: 2), (s, 6), (6 (a) Complete the following table: in degree (b) The digraph G does not contain an eulerian circuit. Explain. there has to be no repect inu arc to be an enleri an circut has t s use (c) It is passible to obtain to an eulerian digraph G from the digraph G' by reversing the direction of one are. That is. G s obtained from G' by deleting the arc (u, v) and adding the are (v 1e) for some distinct nodes u and v. Explain. the directi an of S, 2 (d) Explain how the algorithm we presented in class finds an eulerian circuit of G at node I fully y) ar ti