# linked list and stack. Q-You are given a singly linked...

\# linked list and stack. Q-You are given a singly linked list with folbwing elements: \[ 10 \rightarrow 20 \rightarrow 30 \rightarrow 40 \rightarrow 50 \] (a) Write steps to reverse linked list (b) Illustrate stack's contents at each using a stack. (c) Discuss advantages and disadvantages step. of using a stack for this operation.

Alice has three array-based stacks, $A, B,$ and $C,$ such that $A$ has capacity 100, $B$ has capacity $5,$ and $C$ has capacity $3 .$ Initially, $A$ is full, and $B$ and $C$ are empty. Unfortunately, the person who programmed the class for these stacks made the push and pop methods private. The only method Alice can use is a static method, dump $(S, T),$ which transfers (by iteratively applying the private pop and push methods) elements from stack $S$ to stack $T$ until either $S$ becomes empty or $T$ becomes full. So, for example, starting from our initial configuration and performing dump $(A, C)$ results in $A$ now holding 97 elements and $C$ holding 3 Describe a sequence of dump operations that starts from the initial configuration and results in $B$ holding 4 elements at the end.

Question

Please give Ace some feedback