Problem 4
Create a linked list data structure.
Methods:
Add a new element to the end of the linked list.
Insert a new element into a specific position within the linked list.
Remove a specific element from the linked list.
Find and return an element from the linked list.
Get the slice out of the linked list.
Get the size of the linked list.
Check if the linked list is empty.
! Please check the tests for signature and more examples.