Suppose an algorithm has two parts. The first part involves sorting and takes (10 nlog n) steps, where n is the input size. The second part goes through a FOR loop n times, and each time it takes exactly square root(n) steps. What is the asymptotic time complexity of the overall algorithm, in Big Theta notation? Justify your answer.