[Solved] Analysis of algorithm and finding its time complexity

Order is O(n^1.5).

O(n) < O(n log n) < O(n^1.5) < O(n^2).

So answer is 4.