exercises for source code and help with exercisesplease visit java datastructures net reinforcement - we defined binary search tree so that keys equal to node' key can be in either the left or right subtree of that node suppose we change the definition so that we restrict equal keys to the right subtree what must subtree of binary search tree containing only equal keys look like in this caser- how many different binary search trees can store the keys { , , } - how many different binary search trees can store the keys { , , , } - insertinto an empty binary search treeentries with keys (in this orderdraw the tree after each insertion - suppose that the methods of binarysearchtree (code fragments are used to perform the updates shown in figures and what is the node referenced by action pos after each updater- dr amongus claims that the order in which fixed set of entries is inserted into binary search tree does not matter--the same tree results every time give small example that proves he is wrong - dr amongus claims that the order in which fixed set of entries is inserted into an avl tree does not matter--the same avl tree results every time give small example that proves he is wrong -