Define a function that inserts a given integer into a bst

Question

Problems

(a) Define a HASKELL type whose values are binary search trees (BSTs) with integer components.

(b) Define a function that inserts a given integer into a BST.

(c) Define a function that maps a given unsorted integer list to a BST, using your insertion function.

(d) Define a function that maps a BST to an integer list using left-root-right traversal.

(e) Form the composition of functions (c) and (d). What does it do?