Answer:
Written in Python
word = input("Word: ")
if(word[0]=='a' or word[0]=='e' or word[0]=='i' or word[0] =='o' or word[0]=='u'):
print(word+"ay")
else:
a = word[1:]
print(a+word[0]+"ay")
Explanation:
<em>The program was written in Python and I've added the explanation as an attachment; where I used comments as explanations</em>
Answer: not sure if you can
Explanation: idk if you can but if you wanna get a good answer try searching up on google hope i helped!
The function library group is located in the "formulas" tab
Answer:
i) The time taken for 1500 records = 15 seconds.
ii) The time taken for 1500 records = 50 seconds.
Explanation:
A is an O(n) algorithm.
An algorithm with O(n) efficiency is described as a linearly increasing algorithm, this mean that the rate at which the input increases is linear to the time needed to compute that algorithm with n inputs.
From the question, it is given that for 1000 records, the time required is: 10 seconds.
Algorithm time taken is O(n)
Hence,
1) For 1,500 records
=> 10/1000 = x/1500
=> 10x1500/1000 = x
x = 15 seconds
Thus, the time taken for 1500 records = 15 seconds.
2) For 5,000 records
=> 10/1000 = x/5000
=> 10x5000/1000 = x
x = 50 seconds
Thus, the time taken for 1500 records = 50 seconds.
