import sys

if len(sys.argv) < 2 or sys.argv[1] not in ['q1','q2','q3','q4','q5','q6','q7','q8']:
sys.exit(0)

def fibonacci(n):
fib = []
for i in range(n):
   if i == 0 or i == 1:
         fib.append(1)
   else:
         fib.append(fib[-1]+fib[-2])
return fib[-1]

def merge(l1,l2):
n = min(len(l1),len(l2))
result = []
while len(l1)!= 0 and len(l2)!= 0:
   if l1[0] < l2[0]:
         result.append(l1.pop(0))
   else:
         result.append(l2.pop(0))
if len(l1) == 0:
   result += l2
else:
   result += l1
return result

def asterisksLeft(n):
for i in range(n):
   result = '*'
   for j in range(i):
         result += '*'
   print(result)

def asterisksLeftRecursive(n):
if n > 1:
   asterisksLeftRecursive(n-1);
result = ''
for i in range(n):
   result += '*'
print(result)

def asterisksRight(n):
for i in range(n):
   result = '*'
   for j in range(i):
         result += '*'
   for i in range(n-len(result)):
         result = ' '+result
   print(result)

def asterisksRightRecursive(n,nTotal):
if n > 1:
   asterisksRightRecursive(n-1,nTotal);
result = ''
for i in range(n):
   result += '*'
for i in range(nTotal-len(result)):
   result = ' '+result
print(result)

Exercise 8 The (so-called) Birthday Paradox: 1 Write a function...