Given the following code:$\}$

Let's say in the main function the following statements are executed. Assume that the linked list is initially empty.

head $=$ mystery$($head$,102)$;

head $=$ mystery$($head$,78)$;

head $=$ mystery$($head$,154)$;

head $=$ mystery$($head$,23)$;

How long will the linked list if we changed the return statement at the end of the function $($not the if statement$)$ to return new$\_$node instead of head?