a$)$ When the List is empty

b$)$ In the beginning of the List

c$)$ In the end of the List

d$)$ Somewhere between the beginning and the end of the List.

e$)$ When the LL is not created

f$)$ when a duplicate record is found

The ADD algorithm is to determine where the new node is to be placed

in the List.