consider the array h = [5,11,8,7,4,3,1] of intergers. for heapsort implemented using a binary tree, what is the heap h after the set has been heapified

Drag the tiles to the correct boxes to complete the pairs. match the exponential functions with their horizontal asymptotes and y-intercepts. f(x) = 7x − 4 f(x) = 3x+2 + 4 f(x) = 9x+1 − 4 f(x) = 2x + 4 horizontal asymptote and y-intercept exponential function horizontal asymptote: y = 4 y-intercept: (0, 5) arrowboth horizontal asymptote: y = -4 y-intercept: (0, 5) arrowboth horizontal asymptote: y = -4 y-intercept: (0, -3) arrowboth horizontal asymptote: y = 4 y-intercept: (0, 13) arrowboth