The United States Postal Service (USPS) delivers nearly 200 million pieces of mail every day. Their website and internal operations are powered by many algorithms.Which algorithm's runtime is most likely to be improved by the use of a heuristic?Choose 1 answer:Choose 1 answer:(Choice A)   Identifying the top performing delivery carrier in a region, based on carrier's performance scoresAIdentifying the top performing delivery carrier in a region, based on carrier's performance scores(Choice B)   Calculating an efficient route for a delivery carrier through a city, considering factors like parking space and mail volumeBCalculating an efficient route for a delivery carrier through a city, considering factors like parking space and mail volume(Choice C)   Sorting packages according to expected delivery date, from most urgent to least urgentCSorting packages according to expected delivery date, from most urgent to least urgent(Choice D)   Calculating the cost of a package based on weight and distance to destinationDCalculating the cost of a package based on weight and distance to destination

Which is used to improve the performance of heuristic search?Question 9Answera. Quality of heuristic functionb.Quality of nodesc.Simple form of nodesd.None of the mentioned

Heuristic Evaluation

What is the difference between algorithms and heuristics?Group of answer choicesAlgorithms may require too much time or storage to be practical; heuristics often get a 'good enough' answer, and do it quicklyHeuristics can't be coded onto a computer, algorithms can.None; they're different terms for the same thingAlgorithms are always inefficient, heuristics are always effiicient

Unlike algorithms, heuristics Multiple choice question.do not guarantee a solution.take a great deal of time to implement.guarantee a solution.are effective only at dealing with numerical problems.

In which of the following situations is it most appropriate to use a heuristic solution? A.   The only algorithms that provide exact solutions run in linear time B.   The problem has been identified as undecidable C.   The only algorithms that provide exact solutions run in unreasonable time but exact solutions are not necessary D.   Two different algorithms have been identified that solve the problem in reasonable timeSubmit