Answer:
Implementing on Python for the question, the following is the code.
Explanation:
def intialMatch(l):
word_dict={}
for word in l.split():
if word_dict.get(word)==None:
word_dict[word]=[]
for key in word_dict.keys():
if key[0]==word[0] and (word is not key) :
values = word_dict.get(key)
if word not in values:
values.append(word)
for key,values in word_dict.items():
for value in values:
if value==key:values.remove(value)
return word_dict
t='do what you can with what you have'
print(intialMatch(t))
A. (pie chart) - correct answer
