help

inalyze the snippet of code below. Identify the data structure used in this snippet of code, and explain hat the method decipherMe() is computing. ublic void decipherMe(SomeNode currentNode, SomeNode newNode) \{ String currentName, newNodeKey; int strComparison; newNodeKey = newNode. key; currentKey = currentNode.key; strComparison = currentKey . compareToIgnoreCase ( newNodeKey ); if (strComparison == null) \{ currentNode. leftChild = newNode; newNode. parent = currentNode; \} else \{ decipherMe(currentNode.leftChild, newNode); \} \} nswer (Multiple Choice): a) () The data structure that is used in this snippet of code is a stack. The method decipherMe() implements a PUSH operation. b) ( ) The data structure that is used in this snippet of code is a binary search tree. The method decipherMe() emulates a search to find out where in the binary search tree to insert a new node. c) ( The data structure that is used in this snippet of code is a singly linked list. The method decipherMe() logically removes from the singly linked list the node located immediately after the current node. d) ( The data structure that is used in this snippet of code is a singly linked list. The method decipherMe() inserts a new node into the singly linked list. ixplain your