Express the pseudo code for selection sort in closed algorithmic expression (using Σ from) and use that expres?

Express the pseudo code for selection sort in closed algorithmic expression (using Σ from) and use that expression to show that the running time complexity of the algorithm is given by θ(n^2)