Could use some help with this Discrete Math problem please. The following problem refers to the following algorithm segment. For each positive integer n, let b_n be the number of iterations of the while loop. while (n > 0) n := n div 3 end while Trace the action of this algorithm segment on n when the initial value is 424. PLEASE DON'T USE THE ANSWERS ALREADY GIVEN IN CHEGG. I don't think they are correct. Thanks!