Consider the following pseudocode for an algorithm called “Algorithm1", which reads procedure Algorithml(a1, a2, ..., an:: integers) **.. I:= a1 for i = 2 to n I:= x + a, return a Suppose a list a1,...

Provide me correct and complete solution of all parts please thank please solve step by step all parts correctly

Extracted text: Consider the following pseudocode for an algorithm called “Algorithm1", which reads procedure Algorithml(a1, a2, ..., an:: integers) **.. I:= a1 for i = 2 to n I:= x + a, return a Suppose a list a1, a2, ...,a, of integers is given as an input. a) Describe what Algorithml(a1, a2, ., an) returns as output. b) How many times would the expression r := r+a; be executed? c) Give a O estimate for the time complexity of this algorithm (worst case).