Use code warrior program to solve

An integer n is divisible by 9 if the sum of its digits is divisible by 9. square Develop a program that uses this method to determine whether or not a number is divisible by 9. Test it on the following numbers: n = 154368 n = 621594 n = 123456 square Use the % operator to get each digit; then use/to remove that digit. square So 154368 % 10 gives 8 and 154368/10 gives 15436. The next digit extracted should be 6, then 3 and so on. square