In a Ternary Search algorithm, the array is divided into three parts. Complete the calculation for mid1 and mid2. def ternary_search(arr, target):     low = 0     high = len(arr) - 1     while low <= high:         mid1 = low + (high - low) // 3 # Line to complete mid1         mid2 = high - (high - low) // 3 # Line to complete mid2         if arr[mid1] == target:             return mid1         if arr[mid2] == target:             return mid2         if target < arr[mid1]:             high = mid1 - 1         elif target > arr[mid2]:             low = mid2 + 1         else:             low = mid1 + 1             high = mid2 - 1     return -1

Correct Answer: A (Integer division // is typically used in Python, but the mathematical expression is (high - low) / 3 for the segment length.) • Code Analysis: o The goal is to divide the range [low, high] into three roughly equal parts. o mid1 should be at approximately one-third of the way from low. o mid2 should be at approximately two-thirds of the way from low, or one-third of the way from high (working backward). • Explanation of Correct Answer (A): mid1 = low + (high - low) // 3, mid2 = high - (high - low) // 3 o high - low gives the length of the current search interval. o (high - low) // 3 calculates approximately one-third of this length using integer division. o mid1 = low + (high - low) // 3: This correctly places mid1 one-third of the way from low. o mid2 = high - (high - low) // 3: This correctly places mid2 one-third of the way back from high, effectively making it two-thirds of the way from low. This method avoids potential overflow issues that (low + high) * 2 // 3 might have with very large low and high values, and ensures mid1 and mid2 are distinct and within the bounds.