You are using a polynomial time 2-approximation algorithm to find a tour t for the metric traveling salesman problem. Which of the following statements is true?

A. The tourt is never optimal.
B. The cost of tourt is at most twice the cost of the optimal tour.
C. The The cost of tourt is always 2 times the cost of the optimal tour.
D. The ratio of the cost of the optimal tour divided by the cost of tourt is 2.
E. All of the above

Write a method that takes in an array of point2d objects, and then analyzes the dataset to find points that are close together. be sure to review the point2d api. in your method, if the distance between any pair of points is less than 10, display the distance and the (x, y)s of each point. for example, "the distance between (3,5) and (8,9) is 6.40312." the complete api for the point2d adt may be viewed at ~pf/sedgewick-wayne/algs4/documenta tion/point2d. html (links to an external site.)links to an external site.. try to write your program directly from the api - do not review the adt's source code.

Aman travel 200m towards east< br /> from his house then takes left< br /> to turn and moves 200 m north< br /> find the displacement & distance.< br />

Acollection of computers and other devices that are connected together to enable users to share hardware, software, and data, as well as to communicate electronically with each other is called