Write a recursive algorithm in pseudocode to find the greatestcommon divisor (ged) of two integers using the definition inbelow Figure.In this definition , the expression ‘x mod y ’meansdividing x by y and using the remainder as the result of theoperation.