For linked list implementations, choose all statements that are correct.

Group of answer choices

The run time for insertion in the middle of the linked list for both array and non array implementations is Big$-$O $($n$).$ In other words insertion in the middle is linear.

The run time for deletion in the middle of the linked list for both array and non array implementations is Big$-$O $($n$).$ In other words insertion in the middle is linear.

The run time for insertion at the end of the linked list for the array implementations is Big$-$O $(1).$ In other words insertion at the end is constant time

None of the statements are correct.