Suppose we use lists in Prolog to represent trees in the following way: [left tree, node, right tree]. For example, a tree that has only one node a would be written as [ [], a, [] ].

The list representing the tree above is[ [ [], 1, [] ] ,2 , [ [], 3, [] ] ] , 4 , [ [ [], 5, [] ] , 6 , [ [], 7, [] ] ]

a) Define a predicate that gives the unique list of leaves of a tree.

b) Define a predicate that gives the height of a tree

in Prolog

2 3 5