Need help with a Scala programming problem:

object fp1 {

// EXAMPLE: here is the definition of the factorial function.

def fact (n : Int) : Int = {

if (n

1

else

n * fact (n - 1)

}

 // Given the definition of the function "maxTailRecursive" below, complete the // definition of the function "maxTailRecursiveAux" so that "maxTailRecursive" also finds the // maximum of a list of integers. You must not alter the definition of "maxTailRecursive". Your // definition for "maxTailRecursiveAux" must be recursive and not use while loops. def maxTailRecursiveAux (accumulator : Int, xs : List[Int]) : Int = { // TODO: Provide definition here. -1 } def maxTailRecursive (xs : List[Int]) : Int = { xs match { case Nil => throw new RuntimeException () case y::ys => maxTailRecursiveAux (y, ys) } } 

RULES *1. Submissions MUST compile using SBT with UNCHANGED configuration and tests with no compilation errors. Submissions with compilation errors will receive 0 points Note that refactoring the code will cause the tests to fail. *2. You MUST NOT edit the SBT configuration and tests. Altering it in your *result in 0 points for this assignment. 3. You MUST NOT use while loops or (re)assignment to variables (you can submission will use "val" declarations but not "var" declarations) You must use recursion instead. *4. You may declare auxiliary functions if you like.