This is a software quality question regarding mutation testing. Please solve asap. Thank you

Problem 3 Mutation Testing Total: 12 points] Answer questions (a) through (d) for the mutant in the following method findVal. //Effects: If numbers null throw NullPointerException // else return LAST occurrence of val in numbers // If val not in numbers [] return -1 1. public static int findVal (int numbers ], int val) 2. t 3. int findVal--1; 4. 5. for (int i-0 ; numbers . length; i++) 5.// for (int -(0+1); numbers.length; ++) 6. 7 8 return (findVal); 9. if (numbers [i]- val) findVali; (a) Provide reachability condition, infection condition, and propagation condition for the mutant (b) If possible, find a test input that does NOT reach the mutant. (c) If possible, find a test input that satisfies reachability but not infection for the mutant. (d) If possible, find a test input that satisfies infection, but not propagation for the mutant. (e) If possible, find a test input that strongly kills mutant m Problem 3 Mutation Testing Total: 12 points] Answer questions (a) through (d) for the mutant in the following method findVal. //Effects: If numbers null throw NullPointerException // else return LAST occurrence of val in numbers // If val not in numbers [] return -1 1. public static int findVal (int numbers ], int val) 2. t 3. int findVal--1; 4. 5. for (int i-0 ; numbers . length; i++) 5.// for (int -(0+1); numbers.length; ++) 6. 7 8 return (findVal); 9. if (numbers [i]- val) findVali; (a) Provide reachability condition, infection condition, and propagation condition for the mutant (b) If possible, find a test input that does NOT reach the mutant. (c) If possible, find a test input that satisfies reachability but not infection for the mutant. (d) If possible, find a test input that satisfies infection, but not propagation for the mutant. (e) If possible, find a test input that strongly kills mutant m