( Algorithms and O notation problem) in Discrete mathematics for Computer science

This question about O notation and algorithms problem.

Solve it in detail please!!

thanks!!

Questions 1-3 are about this algorithm, which is expressed in Rosen's pseudocode notation for i := 1 to n forj := i + 1 to n if a,-a, then b := T The algorithm computes a Boolean b given a sequence of integers a1. a, ., an where n20. 1. (5 points.) After the algorithm has finished executing, what does b tell us about the sequence of integers? 2. (5 points.) 3. (10 points.) Express your answer for question 2 in O notation. Use the definition of O notation (Rosen, page 205) to prove that your answer is correct. ill be ec Explin ou ar