Written in Java // return the sum of the last two values in the list, // Precond

ID: 3721837 • Letter: W

Question

Written in Java

// return the sum of the last two values in the list,

// Precondition: the list has at least 2 values

// you can write this iteratively or recursively, but you should only have one loop or recursive helper

// you may not call any other method (e.g. size )

// [0,1,2,5,5,5,5,5,8,9].sumOfLastTwo() == 17

// [0,1].sumOfLastTwo() == 1

public int sumOfLastTwo ( ) {

return -1; //TODO 4: fix this

}

// a function to delete the second node if its value is odd,

// otherwise the list is unchanged

// [0,1,2,8,9].deleteSecondIfOdd() --> [0,2,8,9]

// [0,9].deleteSecondIfOdd() --> [0]

// [0,4,9].deleteSecondIfOdd() --> [0,4,9]

// [].deleteSecondIfOdd() --> []

public void deleteSecondIfOdd () {

// TODO 5: fix this

}

Please find my implementation.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.