Problem 1: Create the following functions: void displayMenu(int k times); int median(int a, int b, int c); void mySort(int a, int b, int c ); void myPermutation (intk a, int\& b, int \& c ); void mySimplify(int\& a, int k b, int k c); int main(); where - (10pt) displayMenu prints a list of options to the console and shows the number of times displayMenu is called - (10pt) median returns the median of three input integers - (15pt) mySort sorts the three integers in descending order - (15pt) myPermutation applies a permutation to the numbers - moving the last to the front (that is, a list of numbers 123 will become 312 after the function call) - (15pt) mySimplify simplifies the three integers by dividing them by their maximum common factor - (15pt) main keeps asking users to enter three positive integers until success (you can assume that users always enter valid integers) and then continuously displays a menu of options and call the corresponding function based on the user input until the user enters Q (you can assume the user always enters valid option numbers or Q)