Please answer the following:

Input: a: positive integer Input: n: positive integer Input: m: positive integer Algorithm: ModulusMystery t a temp Array); 5 while p > 0 do 6 if p is even thern t2 mod m; 7 8 else 9 t at2 mod m; 10 end 11 Add t to temp; 12 p/2J; 13 end 14 Let s be the size of temp 16 for j -1 toi 1 do 1s fori-1 to s 1 do if temp[i] templi] then 17 18 19 20 end 21 end 22 return true; return false; end