WHILEL uses the same datatype of binary trees as WHILE does. Consider now the following trees in D: (a) h h h nil.nili.nili.nili (b) h h h nil.nili.nili.h h h h nil.nili.nili.h nil.nili i.h nil.nili i i (c) h h h h h nil.nili.nili.h nil.nili i.h nil.nili i.h h nil.nili.nili i (d) h h nil.nili.h h nil.nili.h h nil.h nil.nili i.h nil.nili i i i According to our encoding of datatypes in D, decide for each tree (a)(d) whether it encodes i a list of numbers; if it does give the corresponding list. ii a list of lists of numbers; if it does give the corresponding list. Note that an empty list can always be considered a list of numbers and a list of lists of numbers.