Public hugeint modnine (): returns the remainder of the integer stored in the linked list when dividing it by 9. the easiest way to find the remainder of an integer like 235 when dividing it by nine is to calculate the remainder of 2+3+5 instead. use this idea to implement modnine method. method modnine must be able to calculate the remainder of a huge integer like 10 − 1 when being divided by 9. for example, modnine (10 − 1) first sums the digits of the input integer and then calls itself for the calculated sum. it does the same operations recursively until it reaches a one-digit integer. see below for details: modenine (10 − 1) =modenine (99 . . 9) times=modenine ()=modenine (45)=modenine (9)=0;