Consider two algorithms that perform the same function, that run in n/4 and log2(n), respectively, where n ∈ n (i. e. natural ) plot these runtimes on the same graph with the values n ∈ [1, 50] (don’t forget labels). provide the set of intervals over n, where n/4 is the strictly better algorithm to use (think greater than, not greater than or equal).