In a class hierarchy, a subclass reimplements an instance method of a superclass to add more functionality with the same name. In object oriented programming, this phenomenon is known as:

option 1: overriding

option 2:encapsulation

option 3: overloading

option 4: type casting

option 5: inheritance

Given the two functions,f(n)= 2n² + 10and g(n)= n, select the most suitable relationship between the two functions:

Group of answer choices

option 1: f(n) is in o(g(n))

option 2: f(n) is in O(n)

option 3: f(n) is in O(g(n))

option 4: f(n) is (g(n))

option 5: f(n) is in (g(n))

Given the two growth functions, f(n) = n³/100 + 10n² - 100 and g(n) = 10n² where n > 1, what is the smallest value of n (n₀)such that f(n) is in O(g(n))?

Group of answer choices

20

10

11

100

1000

N is greater than 2. Select the tightest (best) lower bound of the growth rate, T(n) = n.

Group of answer choices

(n^0.9)

(log(n))

(n^0.5)

(n^3/2)

(nlog(n))

Suppose that a particular algorithm has a time complexity, T(n) = 8 * n^3/2 and a particular machine take t time for n inputs with this algorithm. If you are given a machine 216 times faster with the same algorithm. How many inputs could we process in the new machine in the same amount of time t?

Group of answer choices

n + 6

n + 36

216n

n + 216

36n