Question 4 (Module Outcome #4): How many compares of the form x; > x, will the following algorithm perform on a list of length n? Express your answer as a rational expression in terms of 7. for i E {1,2, ..., n - 4} do for j E {i + 1,2, ...,n - 3} do if x; > x, then swap x; and x