Given a Python list L of n positive integers, each represented with k = log n _+1 bits, describe an O ( n )-time method for finding a k -bit integer not in L .   Argue why any solution to the previous...

Given a Python list
L
of
n
positive integers, each represented with
k
=

log
n_+1 bits, describe an
O(n)-time method for finding a
k-bit integer

not in
L.

Argue why any solution to the previous problem must run in ∑(n) time.

Describe a way to use recursion to add all the numbers in an
n×n
data

set, represented as a list of lists.

Write a Python function that takes two three-dimensional numeric data

sets and adds them componentwise.