Math Question: This question is concerned with a functional programming language for manipulating binary rooted trees. The set BT consists of all binary rooted trees whose vertices are elements of the set N of natural numbers. The empty tree is denoted by Ø. The following basic primitive functions for manipulating elements of BT are given: ROOT : BT ? N , where ROOT(t) = the root of the non-empty tree t LEFT : BT ? BT , where LEFT(t) = the left subtree of the non-empty tree t RIGHT : BT ? BT , where RIGHT(t) = the right subtree of the non-empty tree t MAKE : BT ? N ? BT ? BT , where MAKE(t, n, s) = the tree with root n, left subtree t and right subtree s MAX : N ? N ? N, where MAX(m, n) = the maximum of m and n (a) Let s be the following element of BT: Draw the trees (i) MAKE(Ø, 9, RIGHT(s)) (ii) (ii) MAKE(RIGHT(LEFT(s)), ROOT(RIGHT(s)), LEFT(LEFT(s)))

Asked By noora On 04/29/2020 18:08