Count the number of TRUE statements about Linked Lists.

1. Time complexity of deleting the last node in a Linked List is O(n).
2. Time complexity of adding a new node in the beginning in a Linked List is O(1).
3. Linked Lists store elements in contiguous memory locations.
4. Time complexity of adding a new node after a specific node in a Linked List is O(n).
5. Linked Lists are dynamic in nature because its size can be increased at runtime.
6. Time complexity of deleting a node in the beginning of a Linked List is O(n).
7. Time complexity of deleting a node after a specific node in a Linked List is O(n).
8. Binary search is not preferred on Linked List because the it is done in O(n) time.