Question: Integers in Java range from -231 to 231 - 1. Consequently, if we have a large array with more than 230 elements, computing the midpoint of a subarray using mid=(low+high)/2 will cause low+high to overflow the integer range if the midpoint resides past array index 230.
a. How large is 230?
b. Show that (low +(high-low)/2) is a computationally equivalent calculation that does not overflow in this situation.
c. How large can an array be using the modification suggested in part (b)?