Recursion: Index Parity of Largest Even

Finding an even integer in an array is kind of trivial and superficial to most programming enthusiasts. This challenge will take it to the next level.

Write a function that returns the largest even integer in an array with its corresponding index and the parity of that index, but determining the parity of that index is limited to not using the modulo operator %. Therefore, devise a way to resolve it.

Although these tasks are achievable with the use of some built-in Array functions, the purpose and intent of this challenge is for your to solve it recursively.

Output Structure

{"@odd|even index " + index_of_largest: largest_integer}

Examples

bitwiseIndex([107, 19, 36, -18, -78, 24, 97]) ➞ {"@even index 2": 36}

bitwiseIndex([31, 7, 2, 13, 7, 9, 10, 13]) ➞ {"@even index 6": 10}

bitwiseIndex([4, 4, 4, 4, 4, 4]) ➞ {"@even index 0": 4}

bitwiseIndex([-31, -7, -13, -7, -9, -13]) ➞ "No even integer found!"

Notes

• The use of the modulo operator %, indexOf() and max() functions are restricted.
• If you think recursion is fun, you can find a collection of those challenges here.
• A non-recursive version of this challenge can be found here.