4. Questions 13-18
In a game, words consist of any combination of at least four letters of the English alphabet. Any sentence consists of exactly five words and satisfies the following conditions:
The five words are written from left to right on a single line in alphabetical1 order.
The sentence is started by any word, and each successive word is formed by applying exactly one of three operations to the word immediately to its left: delete one letter; add one letter; replace one letter with another letter.
At most three of the five words begin with the same letter as one another.
Except for the leftmost word, each word is formed by a different operation from that which formed the word immediately to its left.
. Which one of the following could be a sentence in the word game?
bzeak bleak2 leak peak pea
crbek creek3 reek4 seek sxeek
dream gleam glean5 lean mean
feed freed reed seed seeg
food fool fools fopls opls
. The last letter of the alphabet that the first word of a sentence in the word game can begin with is:
t
w
x
y
z
. If the first word in a sentence is blender and the third word is slender then the second word can be:
bender
gender
lender
sender
tender
. If the first word in a sentence consists of nine letters, then the minimum number of letters that the fourth word can contain is
four
five
six
seven
eight
. If clean is the first word in a sentence and learn is another word in the sentence, then which one of the following is a complete and accurate list of the positions each of which could be the position in which learn occurs in the sentence?
second
third
fourth, fifth
second, third, fourth
third, fourth, fifth
. If the first word in a sentence consists of four letters then the maximum number of letters that the fifth word in this sentence could contain is :
four
five
six
seven
eight
KEYS: BDCDEC
