Brungilda is moving to Wonderland. She has n cubic meters of belongings (n is a positive integer). She would like to pack all belongings into cubic boxes with integer edge lengths so that there is no empty space left in the boxes and the numbe of boxes is as small as possible. Complete the code below to produce function num_boxes(n) that computes the minimal number of boxes. The complexity of the algorithm should be O(n) (in particular, num_boxes(100) should be very fast) For example num_boxes(10) should be 3 because one can put 10 cubic meters into boxes of edge lengths of 1, 1, and 2 13+13 + 23 = 10), but it is impossible to do with smaller number of boxes. import math 1 2 3 4 5 6 7 def num_boxes(n): tbl = [math.inf] * (n + 1) tbl[@] = ??? for j in range(1, n + 1): i = 1 while i**3