13 2 public static int Factorial(int n) 30 4 ant fact = 1; 5 i in 12:51, fact-> 13:3. fact-> 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]. (6 Points)