Implement three following hashing function:

long int midSquare$($long int seed$)$;

long int moduloDivision$($long int seed, long int mod$)$;

long int digitExtraction$($long int seed, int$*$ extractDigits, int size$)$;

Note that:

In midSquare function: we eliminate $2$ last digits and get the $4$ next digits.

In digitExtraction: extractDigits is a sorted array from smallest to largest index of digit in seed $($index starts from $0).$ The array has size size.