What tab must you click on to view any previously read messages from instructors in the message center?
2 answers:
You might be interested in
Answer:
The program code is in explaination
Explanation:
Program code below.
def judge(auction,price):
"""
Function: Returns Name who auctioned very near to give price
Input :
auction : list of tuples
price : auction price
output: returns name of best auction amount holder
"""
diff = [] #storing differences between auctionist amount and price
count = 0
for each_pair in auction:
if each_pair[1]<=price:
diff.append(price-each_pair[1])
else:
count+=1
diff.append(each_pair[1])
if count == len(auction): #check for if no one have auctioned good amount
return None
else:
more_possibility_index = diff.index(min(diff)) #finding index of best amount from diff list
return auction[more_possibility_index][0]
auction = [('Alice',430),('Bob',538),('Carol',487),('David',550)]
price = 520
print(judge(auction,price))
I kept the output at the attachment.
Answer:
The formula for the given problem is given below:
= (1+B$12)×B13
Explanation:
Immediately you do one, then you can autofill the formula to the mentioned range B15:B17 and then to C14 to H17
When been done correctly, this is how the formula will look in those cells if you do it correctly.
Check the file attached below to see it.
