A binary search tree is used to store integer keys. Suppose that this binary search tree has the following behavior in searching. Test case (Case 1) Search key = 45 (Case 2) Search key = 78 (Case 3) Search key = 20 The order of visited tree nodes 61, 32, 50, 41, 45 61, 89, 67, 72, 78 61, 32, 11, 25, 22, 20 Draw the binary search tree with the nodes known from the above information.