Find the number of strings of six lowercase letters from the English alphabet, which satisfies the given conditions. Six lowercase letters contain the letters a and b in consecutive positions with a preceding b, with all the letters distinct.

The answer is 1,275,120

Step-by-step explanation:

The goal of this is to determine the number of strings of strings of six lowercase letters from the English alphabet that contain the letters a and b in positions consecutive with a preceding b, with all the letters distinct.

Now,

As the letters  a and b are consecutive, the possible string outcomes are in this form:

ab_ _ _ _

_ab_ _ _

_ _ab_ _

_ _ _ ab_

_ _ _ _ ab

As seen here, ab can denoted in five locations as in C (5, 1) = 5 ways

we use the permutation for the order of the letters to be needed.

so,

n= 24, r =4

p (24, 4) = 24ǃ /( 24 - 4)ǃ

= 24ǃ /20ǃ

=255,024

Now, the number of possible strings is 5* 255.024 = 1,275,120.

In conclusion there are 1,275,120 number of strings of six lowercase letters from the English alphabet contain the letters a and b in consecutive positions with a preceding b, with all the letters distinct.

if e is the midpoint of bd, then bd is 14.

step-by-step explanation: