Number of steps for Binary Search algorithm in the worst-case scenario

Question

I have this Python definition for the Binary Search:

def binarySearch(target, last):
   lyst.sort()
   left = 0
   right = len(last) - 1
   while left <= r