A digital archive contains a sorted list of 127 unique manuscript reference codes. An archivist uses a binary search algorithm to locate a specific code in the list.

State the number of comparisons required in the best-case and worst-case scenarios to either find the target item or confirm it is not present in the list.