MUST BE WRITTEN IN ELM

Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The number of additions required to obtain a single digit from a number n is called the additive persistence of n, and the digit obtained is called the digital root of n. For example, the sequence obtained from the starting number 9876 is 9876, 30, 3, so 9876 has an additive persistence of 2 and a digital root of 3. Write two Elm functions additivePersistence : Int -> Int digitalRoot : Int -> Int that take positive integer arguments n and, respectively, return the additive persistence and the digital root of n. Once you have implemented the functions, you should get the following behavior at the Elm REPL: > additivePersistence 9876 2 : Int > digitalRoot 9876 3 Int Think about how you can factor the implementations of these two functions into common, reusable parts