please answer multiple choice questions asap from 8-12. make sure your answers are correct and I promise to give you a thumbs up

8) Accessing an element of an array is a) O(n2) b) O(n) c) o(i) 9) The bubble sort is at worst a) O(n2) b) O(n) c) ou) hash table, if the same key is assigned to 2 or more values, this is called a a) overlap b) collision c) error d) duplicate 11) To assign keys to input that consists of strings, such as words, a method which will assign different keys to the same characters in different order, such as "star" and "rats" is a) summation hash b) modulus hash c) cyclic shift hash d) assigning keys according to first character 12) In the Division Method, h(k) Ik) mod N collisions are minimized if N is a) a prime number b) a composite (non-prime) number c) a negative number d) 1/k e) an even number