this is the answer for question one please answer question 2 thank you

Problem 1: Modular multiplication and division are fundamental operations in many public-key cryptosystems. These operations are, for the most part, time-consuming and are commonly regarded the computational bottleneck in these applications. As a result, system designers nowadays turn to VLSI implementation. Your task, as a novice system designer, is to design the 2-bit mod-5 multiplication/division module using only basic logic gates. To guide you in this design problem are the following guidelines: i. In modular multiplication and division, the number 0 is often ignored. Thus, in your design, the following 2-bit number representation is used: 002 1,012 2, 102 3 and 112 4. ii. Some examples of mod-5 multiplication: 4x 2 = 3 (mod 5), 3 x 3 = 4 (mod 5). The block diagram of the 2-bit mod-5 multiplication and division modules appear as shown in Figure 1. 2-bit multiplicand { A0 2-bit mod-5 multiplication CL 2-bit co product 2-bit multiplier {B B 2-bit dividend A Ao 2-bit mod-5 division Di 2-bit DoS quotient 2-bit SB divisor Figure 1.1 Tasks: i. Determine the truth tables and logic circuits (AND-OR implementation) of the 2-bit mod-5 multiplication and division modules. Simplify the logic circuits as much as possible. [30 marks) ii. Convert, with additional logic gates, the 2-bit mod-5 multiplication module into the 2- bit mod-5 division module. Use as few additional logic gates as possible. [10 marks] (1) Truth table of 2-bit multiplier (MODS) :- B2 B3 Jo Ji la f Logic circuit Representation Ao DO .Po DOD-0-0-0 BO- P Half Adder 1 1 01 o o o o o o o o o o o o o o o o - toooooooooooo-oo-o Looooooo-o-o-o-o Loo ooo-o-ooooo-o- As Half Adder IO O 1 P2 BZ P3 A half adder can be implemented wsing one XOR gate followed by one AND gote Results of half adder implemented above are on sum. A B = B+AB Carry = A.B 10 o 1 10 1 1 Moduler Multiplication :- It works just like modubt addition, for example, if modulus is 7. Ex- 5.6 =30= 2 here 2 is remainder on dividing 30 One important point for moduler multiplication by 7 : is multiply two numbers that are non-zero but results zero. that con