please explain how to do this problem

Given the following Prolog program for set membership and set intersection: mymember (E, [E | -] ) . mymember (E, T) :- mymember (E, T). intersect ([], _, []). intersect ([H I T, L2, [H L3]) mymember (H, L2),intersect (T, L2, L3) intersect (I T, L2, L3) :- intersect (T,L2, L3). Show the steps a Prolog interpreter makes in finding the first solution of the query intersect ([1, 2], [2, 3], X). Given the following Prolog program for set membership and set intersection: mymember (E, [E | -] ) . mymember (E, T) :- mymember (E, T). intersect ([], _, []). intersect ([H I T, L2, [H L3]) mymember (H, L2),intersect (T, L2, L3) intersect (I T, L2, L3) :- intersect (T,L2, L3). Show the steps a Prolog interpreter makes in finding the first solution of the query intersect ([1, 2], [2, 3], X)