4. Write 68000 code to implement the subroutine for the flowchart below. Two arrays of the same size, max and min, contain signed integers. The flowchart below insures that, for each pair of corresponding elements, array max contain the larger of the two, and array min the smaller, interchanging them when necessary following linkage The index, i, is unsigned. Assume the DO size A0 address of array max A address of array min MaxMin max(i) 2 min(i)? no exchange max(i) & min(i) Increment i Increment addresses i