Consider the following Python code snippet for binary search:     def binary_search(arr, target):         low = 0         high = len(arr) - 1         while low <= high:             mid = (low + high) // 2             if arr[mid] == target:                 return mid             elif arr[mid] < target:                 low = mid + 1             else:                 high = mid - 1         return -1     my_list = [10, 20, 30, 40, 50, 60]     result = binary_search(my_list, 30) What is the value of mid in the first iteration of the while loop when searching for 30?