(a) Construct a mathematical function T (n) modeling the approximate worst-case runtime of the mystery1 method. Your answer should be written as a summation. You do not need to find the closed form of this summation. You may simplify all constants to stand in variables such as C1 or C2 (you do not need to attempt to count the exact number of operations) public static int mystery1 (int n) { int out = 0; for (int i = if (i % 5 0; i < n; i++) { == 0) { for (int j=0; j