Enable GingerCannot connect to Ginger Check your internet connection or reload the browserDisable in this text fieldRephraseRephrase current sentence2Edit in Ginger Instructions: Answer all the questions below. [10] (1) Imagine we have the list shown in the below implemented as a linked list [READ CHAPTER 5 AND ANSWER] Show what happens if we use the following statement in a search of this linked list: pHead=pHead>link What is the problem with using this kind of statement? Does it justify that two walking pointers (pPre and ploc) was introduced in the text? Explain. (2) Imagine we implement a list using a dummy node at the beginning of the list. The dummy node does not carry any data. It is not the first data node, it is an empty node. The Figure below shows a list with a dummy node : [READ CHAPTER 5 AND ANSWER] Write a short pseudocode to delete the first node (the node after the dummy node) in the link list. Use the Pseudocode style as shown in the book. (3) Evaluate the following Infix expressions to Post Fix and Prefix Expressions : [20] Show working a. (A+B)CDF+C b. (A2(B+C)DE)F (3) If the values of A, B, C, and D are 2, 3, 4, and 5, respectively, manually calculate the value of the following postfix expressions:[10] a. ABCD+ b. ABC+B