Problem: Functions in C language
a) Make a perfect square number function: take its square root until no more whole number root is found and increment the number of operations (nrOfOpr) by one each time. Push the last square root to the stack. (E.g., for 625, push 5 and increment the nrOfOpr of the node to 2)
b) Also, an function called: is AbundantNumber(int num); //returns abundance (if 0 perfect, if > 0 abundant, if < 0 deficient)