def findgreatest

$($

alist

$)$

:

greatest

$=$

$$float

$("$

$-$

Inf"

$)$

for x in alist:

if greatest

$<$

$$x:

greatest

$=$

$$x

return greatest

def calculate

$($

alist

$1$

$,$

$$alist

$2)$

:

result

$=$

$0$

for i in range

$($

len

$($

alist

$1))$

:

for j in range

$($

len

$($

alist

$2))$

:

result

$+$

$=$

$$alist

$1[$

i

$]*$

alist

$2[$

j

$]$

return result How many times the addition operation is performed? Explain the reason.

Q$2.(12$ points$)$ What is the worst$-$case time complexity of the function?

Q$3.(12$ points$)$ What is the best$-$case time complexity of the function?

Q$4.(12$ points$)$ What is the average$-$case time complexity of the function?