3. Dr. Smith claims that the order in which a fixed set of entries is inserted into a binary search tree does not matter-the same tree results every time. Give a small example that proves he is wrong with the help of diagrams. For example, consider inserting elements 3,5,15,2