In the text we developed Java code for traversing a linked list. Here is a, possibly flawed, approach for using a traversal to print the contents of the linked list of strings accessed through letters. Indicate the description that best matches the code. LLNode currNode = letters;

while (currNode != null)

{

System. out. println(currNode. getInfo());

if (currNode. getLink() != null)

currNode = currNode. getLink();

else

currNode = null;

}

a. Very good.
b. Correct but inefficient.
c. Correct but too complex.
d. Will bomb if list is empty.
d. Will bomb if list is not empty.