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))
Answer:
def insSort(arr):
ct=0;
for i in range(1, len(arr)):
key = arr[i]
j = i-1
while j >=0 and key < arr[j] :
arr[j+1] = arr[j]
j -= 1
ct=ct+1;
arr[j+1] = key
return arr,ct;
print(insSort([2,1]))
Output of the program is also attached.
FOR ANYONE THAT WANTS TO STUDY AND CHILL SCREENSHOT BEFORE KATLE DELEATES THIS
meeting id: 932-8097-2909
password: z99LtX
Explanation:
Answer:
False
Explanation:
Chloroplasts = photosynthesis
mitochondria= cellular respiration