Consider the following pseudocode that finds $x$ in a list of sorted numbers by using ternary search. The algorithm is simlar to binary search, only it splits the current list into three parts (instead of two) and checks which part $x$ may be in. Thus at each step, the algorithm removes 2/3 of the items in the current list. Find the complexity of the algorithm. Is it faster or slower asymptotically than binary search