def prettyPrint(n): if n == 1: return [[1]] else: A = prettyPrint(n-1) k = [n for i in range(n+1)] fo