Ouestion $5.$ 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 $a_0,a_1,$cdots,$a_{d-1},a_d,$ then the number is special if $a_0+a_1=$

$a_2$mod$10,a_1+a_2=a_3$mod$10,$cdots,$a_{d-2}+a_{d-1}=a_d$mod$10.$

For example, the number $2358$ is special because $2+3=5,3+5=8.$ However, in Java 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 $L.$ 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.