Online Editor Link (Fork this): LINK Alternatively, you can…

Online Editor Link (Fork this): LINK Alternatively, you can also use the editor here: LINK The multiplicative persistence of a number is the count of steps needed to reduce it to a single digit by multiplying its digits together repeatedly. For example, the multiplicative persistence of 39 is 3 because: Step 1: 3 × 9 = 27 Step 2: 2 × 7 = 14 Step 3: 1 × 4 = 4 And 4 is a single-digit number, so we stop after 3 steps. Write a function calculate_persistence(num) that takes a positive integer as input and returns its multiplicative persistence. Examples: calculate_persistence(4) should return 0 (it’s already a single-digit number, so no steps are needed) calculate_persistence(39) should return 3 (as shown in the example above) calculate_persistence(999) should return 4 (9×9×9=729, 7×2×9=126, 1×2×6=12, 1×2=2) calculate_persistence(77) should return 4 (7×7=49, 4×9=36, 3×6=18, 1×8=8) Your function should work for any positive integer.

Complétez les phrases en l’adjectif possessif approprié. (M…

Complétez les phrases en l’adjectif possessif approprié. (My) auto est en panne. (Your, fam.) livre est intéressant. J’écris à (my) mère. J’aime (his) cravate. Il parle à (her) père. Ils lisent (their) journal. Nous aimons (our) appartement. Paul parle à (his) amie. Ils ont (their) billets. Elle veut (her) argent. Il écrit à (his) mère. Nous écoutons (our) professeurs.