If Siddharth calculates and sorts the distance savings for every pair of restaurants, what are the 3 highest (top 3) values of savings (in meters)?

Dehydrates Private Limited (DePL) is a company based out of Ahmedabad, India, that specializes in providing dehydrated vegetable and fruit packages. These are especially useful for large restaurants in quick cooking and storage. DePL has cracked new deals with 5 such restaurants who have a daily need of SKU S324 - dehydrated onions and DePL plans to supply directly to them. From one of their DCs, the 5 restaurants are placed at distances (in meters) as given in the table below. Restaurants 1 2 3 4 5 DC 1 1003 608 1250 1594 744 2 673 546 1521 616 3 1077 1787 801 4 971 746 5 1013 Siddharth is the logistics lead who is appointed newly and has to plan the delivery routes to serve the 5 restaurants. Having completed SCOX recently, he decides to use the Clark-Wright savings algorithm (no optimization beyond using clark-wright algorithm). He starts by analyzing the delivery routes to restaurants 1 and 3. Two direct routes can be planned from the DC. Plan 1 = DC - restaurant 1 - DC + DC - restaurant 3 - DC Plan 2 = DC - restaurant 1 - restaurant 3 - DC What is the distance savings (in meters) comparing plan 1 and plan 2? Round your answer to the nearest integer. Dehydrates Private Limited (DePL) is a company based out of Ahmedabad, India, that specializes in providing dehydrated vegetable and fruit packages. These are especially useful for large restaurants in quick cooking and storage. DePL has cracked new deals with 5 such restaurants who have a daily need of SKU S324 - dehydrated onions and DePL plans to supply directly to them. From one of their DCs, the 5 restaurants are placed at distances (in meters) as given in the table below. Restaurants 1 2 3 4 5 DC 1 1003 608 1250 1594 744 2 673 546 1521 616 3 1077 1787 801 4 971 746 5 1013 Siddharth is the logistics lead who is appointed newly and has to plan the delivery routes to serve the 5 restaurants. Having completed SCOX recently, he decides to use the Clark-Wright savings algorithm (no optimization beyond using clark-wright algorithm). He starts by analyzing the delivery routes to restaurants 1 and 3. Two direct routes can be planned from the DC. Plan 1 = DC - restaurant 1 - DC + DC - restaurant 3 - DC Plan 2 = DC - restaurant 1 - restaurant 3 - DC What is the distance savings (in meters) comparing plan 1 and plan 2? Round your answer to the nearest integer