Need help with JAVA lab of Calculating very large factorials lab details included in photo.

Would appreciate pseudo code representation for explanation of lab

LuD. Calculating Very Large Factorials assignment will focus on the manipulation of linear linked lists. You are to a Java program that queries the user for an integer, n, and returns the t value of that integer's factorial, n !. The limit to the size of n can be quite This large digits. (up to 9,999), producing factorials containing hundreds and thousands of Needless to say, our methodology will circumvent the inherent sentation limitations of integers and longs in our programming languages The Storage of n! ll be stored in linear linked lists in which each node contains two felds. The first field, info, will hold an integer containing a value from o through 999. The second field, next, holds a reference to the next node in the linear linked list. To be certain that the nature of this storage plan is correctly conceptualized, depicted below are the representations of 10! and 15!: 10 3,628, 800 15, = 1,307,674,368,000 111 307 6741 368 11000 x Note that by storing only three digits per node, the placement of commas in the output is readily 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 15!, stored in a linked list, is the multiplicand. The 6, stored as an ordinary scalar, is the multiplier. The multiplicand is always held in a linked list, and the multiplier is always a numeral between 0 and 9. The action consists of a sequence of vidual multiplications where the number from a nodes info field is multiplied the fixed multiplier. There are as many individual multiplications as there are nodes in the list holding the multiplicand. Page 33 Focus on Data Structures