In order to get the full mark, you must provide the justification of your final answers.

$(8$ points$)$

$($a$)$ Write an algorithm that reads a list of $n$ integers. The algorithm then checks if

the integers are in ascending order. If so$,$ it calculates their sum and outputs it$,$

otherwise, it prints "not in order".

$($b$)$ What is the time complexity of your algorithm in O notation? Give a clear

justification by counting the steps executed by the algorithm for a given integer

input $n.$