Write an algorithm that searches a sorted list of n items by dividing it into three sub-lists of almost n/3 items. This algorithm finds the sub-list that might contain the given item and divides it into three smaller sub-lists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Analyze your algorithm and give the results using order notation.