Insertion Sort.
To sort the first 10 elements- maximum $O(10^2) = O(1)$ time complexity.
Next, $n-60$ elements take $\Theta(n-60)$ time as these would involve no shifting among themselves)
Final 50 elements take $\Theta(50n) = \Theta(n)$ time in worst case to place each of the 50 elements in position.
So, totally $\Theta(n)$.