Answer:
No. This is not more secure.
Explanation:
this is not more secure than having all of Carol, bob and Alice having the same key.
alice would be able to know Carol's key for her to be able to verify the answer Carol gave to a challenge by her. she would also have to know bob's key to do the same.
any of these 3 would have to know someone else's secret key to verify answers to any challenge.
the challenge is to know the secret keys if the other two and if done, decryption can easily be done and they can impersonate.
I think it’s a
if it isn’t a then it’s d
Change owner rights... I think you forgot to put the choices, I am taking a wild guess of what the answers could have been.
Answer:
Create a dynamic-sized circularly-linked list to hold a tuple of the adverts and the count. As the program runs, the sum of the counts is used to calculate the fixed advertisement time which is saved in a variable time_slot. Then a loop statement should be used to traversal the linked list continuously until the count sum is exhausted for the day.
Explanation:
A circularly-linked list is a linked list with both ends joined together. With this data structure, the continuous traversal of the list is easier and faster. A conditional statement is used in the algorithm to check and decrement the count of each advert and when all is zero or false, the program ends.