Translate the following procedure into 8086 assembly language procedure Divs var n: integer begin read n; if n DIV 2 2-n then write 'n is even elsif n DIV 3 3 n then write 'n is odd and divisible by 3 elsif n DIV 5 * 5 = n then write 'n is odd and divisible by S else write 'n is odd' endif if n DIV 9 * 9 = n then write cr, lf, 'n is also divisible by 9 (consider sum of digits of n) " endif end Divs; Note that a simple theorem in number theory states that a is divisible by 9 if and only if the sum of the digits of N is by 9 The file Divs.m contains an Oberon version of this procedure number N divisible Translate the following procedure into 8086 assembly language procedure Divs var n: integer begin read n; if n DIV 2 2-n then write 'n is even elsif n DIV 3 3 n then write 'n is odd and divisible by 3 elsif n DIV 5 * 5 = n then write 'n is odd and divisible by S else write 'n is odd' endif if n DIV 9 * 9 = n then write cr, lf, 'n is also divisible by 9 (consider sum of digits of n) " endif end Divs; Note that a simple theorem in number theory states that a is divisible by 9 if and only if the sum of the digits of N is by 9 The file Divs.m contains an Oberon version of this procedure number N divisible