Please identify the complexity of the following algorithm. You must also provide a justification that explains how you arrived at your answer. Even if your answer is incorrect, a justification will allow us to give you part marks, as well as feedback prior to the exam.

def find_max_a(lis): if len(lis) == 0: return None else: m = lis[0] for i in range(1, len(lis)): if lis[i] > m: m = lis[i] return m