This is Java problem.

The following console application shows a simple example to measure the time required to insert an element (node) at the beginning of a linked list. The application creates several Linked Lists with various size, n, and tests the time required to insert an element in each list. Two questions: 1. What is the time efficiency of the operation in Big O notation? 2. What is the time efficiency of the function in Big O notation