Algorithm 1 shows the pseudocode of the traditional binary search algorithm and we know its time complexity is O(log2n) if we would like to search the entire sorted array array (suppose its length is n). Modify Algorithm 1 so that it splits the input not into two sets of almost-equal sizes, but into three sets of sizes approximately one-third. Write down the pseudocode of your algorithm and analyze its time complexity. Note that you can use
OR
OR