Considering the following pseudocode, a) what does this procedure do? Explain succinctly (that is, do not explain the pseudocode line by line) in no more than three well-written sentences. [1 mark] b) Using big O notation, what is the likely complexity of this algorithm? [0.5 mark] c) Taking into account what the algorithm should do, [1.5 marks] i) write an improved version of this algorithm in pseudocode and ii) provide the likely complexity of the improved version using big O notation (note it can stay the same, but should not get worse). procedure mystery: start read n read list X1, X2, X3, ... En myvar X myvar