Search Run Tools Window Help Editor 37 38 def simulate3DivRule (n): 39 40 "Sum the digits of n and repeat, until you reduce n to a single +ve digit. 41 42> simulate3DivRule (1234) 43 [1234, 1e, 13 >>> sinulate3DivRule (999999) 46 C99999, 54, 9 45 48 > simulate3DivRule (999999999999) 49 [999999999999, 188, 9 50 51 >>> simulate3DivRule (123) 52 [123, 6 53 54 > simulate3DivRule (8) 55 [8] 56 57 Params: n (int) n (you may assume the input is positive) 58 Returns: (list of ints): sequence generated by summing all digits, 59 60 61 until the number is a single digit 62 63 pass # ADD YOUR CODE HERE, REPLACING pass 64 def mod3 (n): 65 66 """Use the 3-divisibility rule to discover if n mod 3 = 8, without division. 67 69 True 70 mod3 (1234) 71 False 72 Returns: (bool) is n mod 3 74 75 76 ? Python