Using pseudo-code, describe an algorithm that will receive an unsorted array (a list of integers where the first index is 0) and find the index location of all integer(s) closest to zero. consider this example: 7. array [7,-8, 3, 2, 14,-5, 6, -2, 10, 2] indeces closest to zero 3, 7,9