Data Structure Question. Answer question 3 and 4

For question 3. first create and attach a node (K)....... finally create and attach a node (S)

Explain. lows. Beginning with an empty linked list, first create then create and attach a node for M, and finally create and attach node d e 3. a. Write Java statements that create the linked list pictu and finally create and attach aode firt b. Repeat Part a, but instead create and attach nodes in the order B,E prev references the first node in this list and curr references the s a. Write Java statements that delete the second node. (Hint: First b. Now assume that curr references the first node of the remaini c. Now head references the only node that is left in the list. Write Java stat e 5-31. Suppose th e second node. 4. Consider the sorted linked list of single characters in Figure 5-31 modi Figure 5-31.) the original list. Write Java statements that delete the last node. ments that insert a new node that contains J into the list so that the is ng two nodesod remains sorted. d. Revise Figure 5-31 so that your new diagram reflects the results of the preou deletions and insertion. head FIGURE 5-31 Linked list for Self-Test Exercises 3, 4, and 7