called with lowerbound= upperbound= lowerbound= upperbound= lowerbound= upperbound= lowerbound= upperbound= version version version version version lowerbound= upperbound= found it at return return return return return returns figure the recursive binarysearch(method the towers of hanoi the towers of hanoi is an ancient puzzle consisting of number of disks placed on three columnsas shown in figure the disks all have different diameters and holes in the middle so they will fit over the columns all the disks start out on column the object of the puzzle is to transfer all the disks from column to column only one disk can be moved at timeand no disk can be placed on disk that' smaller than itself