Q4) A sales person should start from node 3, visit each node once, and return to node 3 sceording to the next distance matrix. Use the nearest neighbor algorithm to find the optimal route length Node 1 Node 2 Node 3 Node 4 Node 1 o 16 8 7 Node 2 9 Dij = 0 17 15 Node 3 10 13 0 14 Node 4 8 8 10 O A) Optimal route length is 39 B) Optimal route length is 37 C) Optimal route length is 42 D) Optimal route length is 26 Q5) In the next distance matrix, if the sales person use a route of 3-1-4-2-5-3 with length of 44 as a starting route. If 4-way reversal algorithm is applied for this route, one of the following statement be correct Node 1 Node 2 Node 3 Node 4 Node 5 14 6 8 10 Node 1 0 6 09 9 11 O Node 2 8 0 Dij = 00 16 14 OO Node 3 9 5 0 OO 15 Node 4 4 13 18 0 10 Node 5 A) The new route will have a length of 59 B) The new route can not be created because of infinities in the distance matrix C) Better route will be achieved D) The length of new route will be 56 06) The next comparison matrix is used to compare between 3 criteria in AHP study to buy Criteria are location, price, and area. Find the average weight of price Area Location Price 5 4 A) 0.6768 B) 0.1925 C) 0.1307 D) 0.153846 1 Location 1 2 0.2 A= Price 1 0.25 0.5