3. Give a recursive algorithm for the sequential search and explain its running time. 4. Most programming languages have a built-in integer data type. Normally this representation has a fixed size,...

Extracted text: 3. Give a recursive algorithm for the sequential search and explain its running time. 4. Most programming languages have a built-in integer data type. Normally this representation has a fixed size, thus placing a limit on how large a value can be stored in an integer variable. Implement a representation for integers that has no size restriction (other than the limits of the computer's available main memory), and thus no practical limit on how large an integer can be stored. Show how your representation can be used to implement the operations of addition, multiplication. a) You are required to have the data structure for un-limit integer data type and a tester class that use your data structure. b) Give and explain the running time of the addition and the multiplication operations.