1- Rewrite the following postfix expression in the infix form

a b + c d + 8* e / f - =

2-Using Big-O notation, what's the overall worst case performance of the following fragment

i = j = k = 0

for i in range(n)

for j in range (n)

for k in range (n)

sum +=I*j*k

for l in range(n)

sum -= I*j*k

for m in range(n):

sum += m*n

sum =(i+j) * (k*l) *(k*l) *(m+n)

3- Given the following class definition complete class Deer by adding a call to the constructer of this superclass

class Animal:

def__init__(self, feet):

self._feet = feet

class deer(Animal):

def__init__(self, feet, color):

#TOOD: call superclass properly

self._color= color