Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm:

A = {1, 2, 3, ..., 45} B = {-7, -6, -5, ..., 27}

Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations):

#Part 1: computes A - B and its cardinality

AminusB = set() for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B

n = len(AminusB) #len() returns the number of elements in the array print(n)

What value is printed as a result of executing this algorithm?

Your Answer:

Q10A. Consider the following algorithm:

g₁ = 3

g₂ = 4

for k > 2:

g_k = (k-1)g_k-1 - g_k-2

What is term g₆of the recursive sequence generated as a result of executing this algorithm?

Your Answer: