Problem Page Suppose we want to choose 2 letters, without replacement, from the 4 letters A, B, C, and D.

Note: Consider we need to find the possible number of ways to choose 2 letters, without replacement, from the 4 letters A, B, C, and D.

Given:

Number of letters = 4

Number of letters selected without replacement = 2

To find:

The total possible number of ways.

Solution:

We have 4 letters A, B, C and D.

So, the number of ways to select first letter is 4.

After selecting a letter the number of remaining letters is 3.

So, the number of ways to select second letter is 3.

Now, the total number of ways to select 2 letters, without replacement, from the 4 letters A, B, C, and D is:

Therefore, the required number of ways is 12.

step-by-step explanation:

hello,

as we don't know if g(x) is continue,

answer b

f(x)=2x²-8x+1=2(x²-4x+4)+1-8=2(x-2)²-7

vertex is (2,-7) ( a minimum since coefficient of x² is > 0)