Complete the missing code for the given node insertion of a singly linked list. Answer must be CASE sensitive and adhere with correct syntax of C# .NET. *

int x) { public void InsertNode(int if (index < 0) return; int currIndex = 1; Node currNode = head; while (currNode != null && index > currIndex) currNode = currNode. Next; PROBLEM (A) PROBLEM (B) PROBLEM (C) currIndex++; if (index > 0 && currNode == null) return; Node newNode = new Node(x); if (. newNode. Next = head; head = newNode; Telse { newNode. Next = currNode.Mext; currNode. Next = Create a new node and hsert as first element in the list { head return; newNode Your answer