a) Consider this Algorithm-Z , Taking list of integer as input List Of Integer: X(Integer: number) List Of Integer: Y Integer: i = 2 While (i 1) Then Y.Add(number) Return Y End X (i) Explain what...

a)      Consider this Algorithm-Z , Taking list of integer as input

List Of Integer: X(Integer: number)

     List Of Integer: Y

     Integer: i = 2

     While (i <>

While (number Mod i == 0)

                                      Y.Add(i)

number = number / i

End While

i = i + 1

End While

If (number > 1) Then Y.Add(number)

     Return Y

End X

(i)                 Explain what Algorithm Z is doing?

(ii)               Analyze the complexity of Algo-Z and then write an algorithm Better-Algo-X that does exactly the same thing but with a strictly better time complexity