Custom Problem #2: Integer Division: From the slide titled "Enhanced Processor w/PC Tester Circuit" from the lecture segment titled Programming a CPU with Machine Language - The Execution, implement the following division algorithm: C = 0; do { A = A-B; C = C + 1; } while (A >= 0); C = C-1; NOTE: this algorithm uses a "do-while loop. It is slightly different than a normal while loop. The computer will always go through the loop once, and then check the condition before it performs it again. This differs from a while loop that will only perform the loop IF the condition is first met. a) Show a Flow Chart, like the one shown in the previous segment, Programming a CPU with Machine Language - The Setup, this will help you break the program into its various "states." b) Show a table like the one shown on the slide titled Multiply Algorithm: Control Memory Contents from the lecture segment Programming a CPU with Machine Language - The Execution, listing the values of the control signals necessary to implement the algorithm above. You may assign registers any way you like to hold your variables and necessary data, but state it up front! c) Show an Execution Trace (like the one shown in the same lecture segment) for your program in step (b). For your trace, assume A=5 and B=2. Custom Problem #3: Summing Up Numbers For this problem you will once again use the "Enhanced Processor w/PC Tester Circuit" shown in the slides. This time you will create the algorithm that you will implement. Your algorithm will take as input an unsigned number: A. It must then compute the sum of all the numbers from 1 up to and including A. As an example, if A=5, your algorithm will compute 15 by adding: 1+2+3+4+5. You may assume (as we have in all previous algorithms) that the input A is already loaded in your register file, as well as any other numbers you require. You must use a loop to implement your algorithm. a) Write out your algorithm in pseudocode as shown in custom problem #2 for your algorithm. b) Show a flowchart of your program using the Multiply Algorithm: Flow Chart/State Diagram" example from the slides in the segment on Programming a CPU with Machine Language - The Setup. c) Show a table like the one shown in the slides titled Multiply Algorithm: Control Memory Contents, listing the values of the control signals necessary to implement the algorithm above. You may assign registers any way you like to hold your variables and necessary data, but state it up front! d) Show an Execution Trace" like the one shown in the same lecture segment for your program in step (c). For your trace, assume A=3. e) Take into account the limits of our processor, determine the largest value for the unsigned integer A that your algorithm will still compute the correct