plz do the below Q#10 according to above given CASE

CASE: Delivery Robots Fleets of delivery robots as the ones presented in the figure below are tested in several UK cities. Assume you are helping to build the autonomous agents that control these robots, and you are given the following information: - The main goal of the robots is to deliver groceries from a local store to a given customer's house and comeback to the store's charging station. - Robots are capable of the following actions: wait (to be loaded or emptied), unlock storage chamber, lock storage chamber, calculate route (once destination is set i.e.towards customer or store), move towards destination (once a route has been calculated). - Robots move within three main spaces: store, street, and customer premises. source:CAMBS COUNTY COUNCIL 10. Imagine now that a new order, requiring only 1 robot, comes in and 5 robots are available to serve it. Each robot calculates a different route to make the delivery and each route has an associated utility, inversely derived from the expected energy consumption for the journey. The available routes and utilities are as follows: - Delivery Robot 1 - route 1 with expected energy consumption of 5Wh and utility of 5 - Delivery Robot 2- route 2 with expected energy consumption of 3Wh and utility of 7 - Delivery Robot 3 - route 3 with expected energy consumption of 6Wh and utility of 4 - Delivery Robot 4 - route 4 with expected energy consumption of 7Wh and utility of 3 - Delivery Robot 5 - route 5 with expected energy consumption of 7Wh and utility of 3 The robot to serve the order will be allocated following an auction process where the final bid from each robot is the route and utility of the journey. Which of the following can be said about the allocation process if a Vickrey auction is used: A) The Delivery Robot 2 is the winner and will deliver via route 2. B) The Delivery Robot 2 is the winner and will deliver via route 1. C) The Delivery Robot 5 is the winner and will deliver via route 1. D) The bidding process is sequential, each robot bidding in turns. E) The robots bidding the last, have higher likelihood of winning