In Python, write a driver script that does the following:

Create a binary search tree from an array of random numbers $(`$Array$.$new$(15)\{$ rand$(1.\mathrm{.}100)\}`)$

Confirm that the tree is balanced by calling $`$#balanced?$`$

Print out all elements in level, pre, post, and in order

Try to unbalance the tree by adding several numbers $100$

Confirm that the tree is unbalanced by calling $`$#balanced?$`$

Balance the tree by calling $`$#rebalance!$`$

Confirm that the tree is balanced by calling $`$#balanced?$`$

Print out all elements in level, pre, post, and in order