Please solve

4. Dranv the binary tree representation for the following list: {a,[b],c,[],[[d,[e]]],(4 marks) 5. Define a Prolog predicate with three lists as arguments that returns True if the third list is obtained from the first list by eliminating those elements that appear in the second list. Example: ?diff([2,5,4,9,1],[6,2,0,3,9],R). R=[5,4,1]. Hint: you may use the member predicate