Assume each list has a head pointer but no tail pointer.
Assume each list has a 'next' pointer but no 'prev' pointer.
There is a function len(L1), len(L2) that returns the length of L1 or L2.
Assume each pointer uses 8 bytes.

How long does it take to print the list L1?


How long does it take to append a single item to the front of L1?


How long does it take to append a single item to the back of L1?


How long does it take to find out if L1 has a '42' in it?


How long does it take to find out if L1 has a '42' in it IF L1 IS IN SORTED ORDER?


How long does it take to append L2 the the front of L1?


How long does it take to append L2 the the back of L1?


How long does it take to find the smallest item of L1?



-----Bonus--------

How long does it take to decide if L1 has any duplicate entries?