3. THE FIRST PART: THE RO SEARCH ALGORITHM The first scenario we consider is inspired by RAID O. In this scenario we start with an array A of length N storing non-negative integers, and create two new arrays where the first array stores the values A[i] where i is an even number, and the second array stores the values A[j] where j is an odd number. The following diagram shows this scenario: A: 7 5 6 3 2 1 4 8 9 1 2 3 7 A1: 7 6 2 4 9 12: 5 318 2 3 There are now two new arrays, A1 and A2, are created and the values at even-numbered indices of A are copied to A1, and the values at odd-numbered indices are copied to A2. The idea is now that instead of storing A, we store two separate arrays in a distributed manner. However, if we want to search the array A for particular values, we now need to search these two arrays and then relate the indices back to the original array. The next two tasks together give such a method to search the two arrays in this scenario. Task 1: Consider the following pseudocode function that describes the RO Search algorithm: function R(key, A1, A2,N) for