How many distinct binary search trees can be formed which contains the integers 1, 2, 3?.

answer: for each 3 girls there is 2 boys . 3: 2

hope this ! (:   mark me as brainliest if you can

the answer is b: 18

step-by-step explanation:

use the pythagorean theorem to .

a^2+b^2=c^2

plug 18 for "r"

the 2 legs are 18 and 24

18^2+24^2=c^2

324+576=c^2

900=c^2

c=30

30-12=18

18 is the radius

: )

the answer is:

the correct option:

b.

to solve the problem, we need to remember how to operate to simplify exponential expressions using the logarithms.

we are given the equation:

then, using placing logarith with base 7 on both sides of the equation, we have:

so, rounding the obtained result to two decimal places (nearest hundreth), we have:

hence, we have that the correct option:

b.

have a nice day!

8

step-by-step explanation: