Please slove this with clarification

True or false (and explain why) . (n*3 in O(3n)) (3n in O(n 3)) Solve the following recurrences (T(n) -2T(n/4)1) Design project You are given an array of length (n) that is filled with two symbols (zeros and ones) all (m) copies of zero appear first, at the beginning of the array. followed by all (n-m) copies of one. You are to find the index or As usual: State your algorithm in the language of your choice. - Test it on some good examples. Prove it is correct - Analyze its runtime. In this case, since a specific runtime is required, prove that it is (oniog