You want to create a study plan for your final exam, containing everything you should do daily starting from SWOTVAC until the day before the exam. What would be most appropriate to store your study plan knowing you may need to add new things as you remember and want to access items randomly.

When using a Circular Queue, which of the following statements are true for a Circular Queue?

If we need to frequently use the union() operation for two sets, what implementation of the Set ADT would be "cheaper" in terms of the time complexity of this operation?

How many times will the marked line in the following code run when the size of the input list is n elements?

def mystery(n):
    res = 0
    if n == 0:
        return res
    else:
        i=0
        while i < n: 
            for j in range(n):
                res += j          # This line
            i+=1
    
    return res

Answer in terms of n