Trace the path of a binary search for the value $49$ in the array below. You will need to identify which indices the search will visit before finding the value, as well as the range of indices which have not yet been eliminated from consideration $($after every iteration$).$ Each iteration of the loop should be depicted on its own line. Show the progress of the algorithm; code is neither required nor desired. For example, the first iteration starts with: Left: $0$ Right: $11$ Midpoint: $5$ Indices not yet eliminated: $($write the range of indices here$)$ list$\_$to$\_$search $=[2,11,17,21,32,33,42,49,57,66,72,81]$