1point) this question concerns bit strings of length six. these bit strings can be divided up into four types depending on their initial and terminal bit. thus the types are: 00, 01, 10, 11. how many bit strings of length six must you select before you are sure to have at least 4 that are of the same type? (assume that when you select bit strings you always select different ones from ones you have already selected.)

the distance between point a and point b is 6 units

he spend 5.1 minutes chatting with his friends.

step-by-step explanation:

2/5+1/2=9/10

6/1-9/10=5.1

37/3

step-by-step explanation:

step 1: simplify both sides of the equation.

7x+8(x+

1

4

)=3(6x−9)−8

7x+(8)(x)+(8)(

1

4

)=(3)(6x)+(3)(−9)+−8(distribute)

7x+8x+2=18x+−27+−8

(7x+8x)+(2)=(18x)+(−27+−8)(combine like terms)

15x+2=18x+−35

15x+2=18x−35

tep 2: subtract 18x from both sides.

15x+2−18x=18x−35−18x

−3x+2=−35

step 3: subtract 2 from both sides.

−3x+2−2=−35−2

−3x=−37

step 4: divide both sides by -3.

−3x

−3

=

−37

−3

x=

37

3