Q1: Complete the following program by writing its functions: static void Main(....) { double z; long P=1; int a, b, c=-4; int[] f = {1, 3, 9, 10, 12, 7, 8); int g = abs (c); // return absolute value of c Prime (f, out b); // b=the average of Prime numbers in f Find (g, out z); // z = 1! + 2! + + g! Power (a[1], a[2], ref p); // where = a[1]a[2] double d=fact (g); // return the factorial of x using // recursion principle Max (f); // print the maximum value of f Console.Write("{0}: {1}: {2}: {3}: {4}",g,b, z,p,d)