a) Given an array of integers of any size, n ≥ 1, write an algorithm as a pseudo code (not a program!) that would reverse the content of the left half of the array, while leaving the right half intact. If the given array is of an odd size, then the left half is considered to have n/2 + 1 elements. Additionally, your algorithm cannot use any auxiliary storage such as array to perform what is needed.
thank you