Answer the following questions. a. how many different strings can be made using all letters of the word abracatabra? b. write a longest possible string with no repetitions using the letters of the word abracatabra

a. 83,160.

b.  abrct.

Step-by-step explanation:

If all the letters were different the number would be 11! but there are 5 A's so we divide by 5! . Also there are  2 b's so we divide by 2! and 2 r's so we divide by another 2!

a. Number of strings =  11! / (5! 2! 2!)

= 11*10*9*8*7*6 / 4

= 11*10*9*2*7*6

= 83,160.

b. That would be abrct.

add an image

step-by-step explanation:

i am unable to solve this problem

step-by-step explanation: