H For the directed graph a) write recursive programs Ge Curth predicates path/2 & d edge/2) to search for path in G Put edges in a b) Check the query = 3x path (ax) (0) In SWISH Prolog. c) Draw the corresponding SLD tree for (a) up to the 3rd success leaf Curth extra calculations) d) Explain responses in 6) to >>path(ax) in the context of the SLD tree from c)