(10 marks) Give a worst-case analysis of the following (admittedly sub-optimal, but still useful for analysis practice!) algorithm: Problem: Create an ordered copy of an array . Precondition: X is an unordered integer array X = [to, , zn-1] whose elements , e ordered type X in ascending order, X is un- modified (10 marks) Give a worst-case analysis of the following (admittedly sub-optimal, but still useful for analysis practice!) algorithm: Problem: Create an ordered copy of an array . Precondition: X is an unordered integer array X = [to, , zn-1] whose elements , e ordered type X in ascending order, X is un- modified