i need solve all these questions please

- Write function distance that calculates the distance between two points (x1,y1) and (x2,y2). All numbers and return values should be of type double. double distance( double xone, double yone, double xino, double yero,) f return sqre ( pow ( xone - xrwo, 2) + pow ( yone - yrwo, 2) ); 1 (Reverst Digits) Write a function that takes an inseger value and returns the number with its digits reversed. For example, given the number 7631, the function should return 1367. (Recursive Greatest Common Divisar) The greatest conmon divisor of integers x and y is the larget integer that evenly divides both x and y. Write a recursive function ged that returns the greatest common divisor of x and y. defined recursively as follows: If y is equal to 0 , then ged (x,y) is x; otherwise, ged(x,y) is ged (y,x%y), where % is the modulus operator. [Nore: For this algorithm, x must be larger than y.]