Question $4($Module Outcome #$4)$: How many compares of the form $x_i>x_j$ will the following

algorithm perform on a list of length $n?$ Express your answer as a sum and then use the result $1$

to express your answer as rational expression in terms of $n.$

for iin$\{1,2,$dots,$n-2\}$ do

for jin$\{i+1,2,$dots,$n-1\}$ do

if $x_i>x_i$ then swap $x_i$ and $x_i$