Let A[O...n-1) be an unsorted array of positive integers, in the range of (0,..., n"). Entries in A are not necessarily unique. Design an algorithm that tests whether there are two numbers in A that are exactly ten apart, i.e. A[i] - A[j] = 10 for some indexes i, j = {0, 1,...n-1}. For example, the algorithm should return "yes" if the array is A= 4, 1, 10, 6, 5, 11), because numbers 1 and 11 are 10 units apart. It should return "no" on A= (10,5, 13, 1, 14,2). The worst-case run-time of your algorithm must be O(n). You can use O(n) additional space. Let A[O...n-1) be an unsorted array of positive integers, in the range of (0,..., n"). Entries in A are not necessarily unique. Design an algorithm that tests whether there are two numbers in A that are exactly ten apart, i.e. A[i] - A[j] = 10 for some indexes i, j = {0, 1,...n-1}. For example, the algorithm should return "yes" if the array is A= 4, 1, 10, 6, 5, 11), because numbers 1 and 11 are 10 units apart. It should return "no" on A= (10,5, 13, 1, 14,2). The worst-case run-time of your algorithm must be O(n). You can use O(n) additional space