of all divisors of a number. Your code should pass these tests: assert sum_div(8)==7 assert sum_div(12)==16 assert sum_div(7)==1 [BEGIN] Table 28 | An example of MBPP. 46 PROMPT The following are multiple

_arange_shape_func(start, stop, step): out = output_tensor((1,), "int64") out[0] = int64(ceil_div((int64(stop[0]) - int64(start[0])), int64(step[0]))) return out @_reg.register_shape_func("arange"