SPECIAL numbers $[20$ pts$]$

A number is considered SPECIAL if the sum of every two adjacent digits equals the next number

modulus $10.$ More precisely, if the digits are $!,$$$,,\%$&$$,\%,$ then the number is special if $!+$$ $=$

$"10,$$ $+"=\text{'}10,,\%$&$"+\%$&$ $=\%10.$

For example, the number $2358$ is special because $2+3=5,3+5=8.$ However, the number $414$ is

not special because $4+1=5,$ but the third number is $4.$

The digits of the number are stored in nodes of a singly linked list $.$ Using only a stack and no other

auxiliary data structures, write pseudocode or Java code for a method $$isSpecial$$ that determines if the

number is special.

Note: You are allowed to use only the stack and a constant number of temporary variables.