8 2) public static int Factorial(int n) 319 int i), fact = 1; 5 i en 12: t3: 3. fact-6) Consider the following Factorial program P to answer the following: A) How many path(s) in the Factorial program given? What are they? B) Is T adequate for testing the Factorial program using path coverage criterion? [Hint: To get the full mark, you must show how adequacy is calculated]. 17 (6 Points)<>