A pseudo-complete binary tree is a binary tree that becomes a perfect tree when the bottom level is removed. Consider the OBST problem for the sorted array aa1 < aa2 < ⋯< aann where all the qqii’s are equal to 0 and all the ppii’s are equal to 1 nn. Prove that the optimal binary search trees in this case are the pseudo-complete binary search trees.

option 1 is correct.

step-by-step explanation:

y varies inversely with x and constant of variation is 4

the equation will be:

y = k/x

where k =4 so,

y = 4/x

if we put values of x of option 1 in the above equation and find values of y

y = 4/-2 => y =-2

y = 4/-1 => y = -4

y = 4/1 => y = 4

y = 4/2 => y =2

so, all the values of x and y are correct.

if we put values of x given in other options and find value of y we cannot find whole table satisfying the equation.

hence option 1 is correct.

no i do not : ( what is it?

60°

step-by-step explanation:

the measure angle of c in an isosceles triangle abc is 60° because in isosceles triangle,the measures of all the angles is 60°.