Write a method that returns a new copy of an array, but with each element shifted left or right by 'howFar' locations in the array. The whole array will either be shifted left by 'howFar' if 'left' is true, but otherwise will be shifted right. As preconditions you may assume that 'howFar' will be a positive number less than the length of the array. Since 'howFar' must be positive and smaller than the length of the array, that makes the smallest allowed value of 'howFar' ONE. Since the array must be longer than that, the smallest allowed array has length TWO. You may not use ArrayList or any other preexisting object-oriented data structures. Look at the test data for examples.