this is java

Question-4: (10) Assume that the time to execute an algorithm with input size k is given as follows. Express the time complexity using big-oh notation. T(k) = 200log K2 + 3k + Blog K10 Question-5: (10) Given a sorted array containing 1, 2, 4, 8, 16, 32, 64, 128, 256,512. Suppose we want to search for 512, How many comparisons are needed that compare the elements with 512 using Binary Search? How many comparisons are needed among the elements and 512 using Linear Search