h: Calculating Very Large Factorials on the manipulation of linear linked lists. You are to ment W that queries the user for an integer, n, and retuns the as sava prograngers factorial, n!. The limit to the size of n can be quite This assignment will focus exact value of that integ ange eless to say, our methodology will circumvent the factorials containing hundreds and thousands of 9,999), producing limitations of integers and longs in our programming languages. storage tored in linear linked lists in which each node contains two Factorials will be s field, info, will hold an integer containing a value from O through The d field, next, holds a reference to the next node in the linear tain that the nature of this storage plan is correctly helcas The secon inked list. To be cer conceptualized, depicted below are the representations of 10! and 15! 3, 628, 800 31 6281 800 X 15! 1,307,674,368, 000 1 307 1I 674I 368 >1 0001 Note that by storing only three digits per node, the placement of commas in the out is readi accomplished as just another action in stepping from one node to the next. Multiplication Suppose that the value of 15! is to be multiplied by 6. The value of 15t, stored n a linked list, is the multiplicand. The 6, stored as an ordinary scalar, is the muThemultiplicand is always held in a linked list, and the multiplier is ual multiplications where the number from a nodes info field is multiplied ere are as many individual multiplications as there are alwa ys a numeral between 0 and 9. The action consists of a sequence of by the fixed multiplier. Th nodes in the list holding the multiplicand Page 333 Focus on Data Structures