Pg prove with Ni-M4 that LAINP, where M4 - method based on treth table M2 - forwoud-inference chain applied to resolution M3 method based on umsatistiability of Aul? } 140pts M4 - methodl based on refutation For the directed graph a) write recurrsive programa (with predicotes path/al d edge/2) to search for path in God gesloten b) Check the query A = 3x path(x) in SwiSH Prolog c) Dract the come sponding SLD tree for (o) up to the 3rd success leaf Cantle extra calculations) d) Explain responses in 'to >>pathal) in the context of the SLD tree from c) 30pts