以下是用动态规划算法(自底而上)解决“那契”问题的Python程序,请在空白处填入相应代码,以使程序完备。 def fib_bottom_to_top(n): global memo memo = {} for k in range(n+1): if k <= 1: f = ________ else: f = _______________ memo[k] = _________ return memo,f print(fib_bottom_to_top(5)) print(memo.items())