Please explain in details.

13 Linked Lists 13.1 Recursion is fun. Fill in the missing code. The number of lines corresponds to the answer key. Your code may vary public class Link [ String value; final Link next; public Link(String val ,Link next) [ value - val; this. next - next; public String toString) 1 if (next != null) return value + ","+next; else return value; public static void main (String [] args) t Link 11 - new Link("a" , new Link ("b" ,new Link("c",null))) System . out.println(11); // output a,b, c