What is the complexity of the following Python code snippet in Big- O notation? Assume is a list of n unsorted numbers;data 2 is a list of n sorted numbers.  def binary_search(data, value):  n = len(data)  left = 0  right = n - 1  while left <= right:  middle = (left + right) // 2  if value < data[middle]:  right = middle - 1  elif value > data[middle]:  left = middle + 1  else:  return middle  return 'Value is not in the list'

1,3

What is the complexity of the following Python code snippet in Big- O notation? Assume is a list of n unsorted numbers;data 2 is a list of n sorted numbers. 

def binary_search(data, value):
 n = len(data)
 left = 0
 right = n - 1
 while left <= right:
 middle = (left + right) // 2
 if value < data[middle]:
 right = middle - 1
 elif value > data[middle]:
 left = middle + 1
 else:
 return middle
 return 'Value is not in the list' 
result = []
for value in data1:
 result.append(binary_search(data2, value))