3. (6 points) Consider the following polymorphic tree data type and combinator type ‘a btree l Leaf I Node of ‘a btree’a ‘a btree let rec treeFold f te- match t with l Leaf -e I Node(t1, n, t2) -f (treeFold f t1 e) n (treeFold f t2) Page 2 Using treeFold and auxiliary non-recursive functions: a) write functional implementations (i.e. without imperative constructs) defining non-recursively b) describe why your solutions successfully implement
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured