Lab 6 Conditional Branching In this lab you will implement an algorithrm for word-size signed
integer divison. Given 4 word-size values N (numeratorl, D denominator), Q (quotient), and R
[remainder). 5ienec integer division has 4 cases: DN=QrR,DN=QrR,DN=QrR,DQ=QrR The above
can be implemented as follows: 1. Initiallze sign casc =0{ pcsitive N, pasitive 0}. 2 If N<0 2. then:
apply 2's complement to make it pasitive 4. increment sign case. 5. endif 5. If D<0 3. then: apply 2
's complement to make it positive E. sign case = sign cose +2 2. endif 10. while ND 11. N=ND 12
increment Q 13. endw 1.. R=N 15. if case =1 then: apply Z's complement Q and R clscif case =2
then: complement a 19. endif A word is made ug of 2 bytes. To apply Z's complement to a word,
complement each byte separately. then add 1. Create a special check for D=0, If D=0 then you
can skip the while and write Q=D, N=0 to represent NaN INot-a-Numberl. A similar check can be
done for D=1 for faster/ellicient programming. Recommendation: Start by implementing the abave
algarithm for integer bytc. Submitting an integer byte implementation of the assignment corstitutes
85% effort. Report Submit a mini-report (not the full-report with all sections), that includes the
followirg in a single file: 1. Code with each line numbered 2. Test cases: b. Test far special values
of N,O: min, 0,1 , mak 3. Show screenshot of the results