43. In this section we developed Java code for traversing a linked list. Here are sev- eral alternate, possibly flawed, approaches for traversal of the linked list accessed through letters. Critique each of them: a. LLString No de curr Node = letters: while (curr Node != null) { System out.println(curr Node.getInfo(); curr Node = curr Node, get Link(): } b. LLString Node curr Node = letters; while (curr Node != null) 1 curr Node = curr Node. get Link(); System out.println(curr Node.getInfo(); 3