Write a recursive algorithm (IN PSEUDOCODE) that searches a sorted list of n items by dividing it into three sublists of almost n/3 itemsmeach. This algorithm will test the element at position n/3 and the element at position 2n/3. It finds the sublist that might contain the target item, and divides the list into three smaller sublists of almost equal size. This process is repeated until it finds the item or concludes that the item is not in the list. Please write this in pseudocode and not java code.