Draw a Binary Search Tree with the following numbers when they are

inserted in the order given: $50,20,10,15,70,25,45,80,100,90$

$2)$

a$)$ Draw a version of the above tree that is height balanced

b$)$ Draw a version of the above tree that is weight balanced