L$3\mathrm{.}1$ Write a subroutine that finds and returns the maximum odd element of

an array of $N8-$bit integers. The base address of the array and the array count

are passed to this subroutine in index register $x$ and accumulator $B,$ respec$-$

tively. The result should be returned in accumulator B$.$ Return a $0$ when the

array has no odd numbers. Also write a main program to test this subroutine.

Invoke Buffalo $\frac{1}{O}$ routines to output the result. Output the following mes$-$

sage if there is the maximum odd element:

The maximum odd element of the array is xxxx$.$

Otherwise, output the following message: