When performing a binary search on a list of 15 elements, the initial middle index is found at position 7. If the key is less than the element at position 7, and binary search is recursively called on the left subarray, what will be the new middle index?