Using Scheme:

Consider the tree below and its list representation in Scheme, 2 3 8 9 10 12 (1 (4 (9 (12))) Write a Scheme function to obtain the children of a node in decreasing order. The order of the nodes in the tree is arbitrary, i.e., you must sort the children. You can assume that the numbers stored in the nodes of the tree are unique, Example: (define atree (10 (2 (4 (9 (3)) (5 (7) (21)) (children 5 atree) (21 7)