please answer these few multiply choice questions about Java programming, Thank you so much!

1) The order of inserting an element into its place in an unsorted list implemented in an array.

a) O(1) b) O(logN) c)O(N) D) O(N logN) E) O(N*N)

2) The order of inserting an element into a sorted list implemented in an array.

a) O(1) b) O(logN) c)O(N) D) O(N logN) E) O(N*N)

3) inserting into an unsorted list and inserting into a sorted list are the same time complexity.

True or False?