ifyou for obtaining the shortest such tour except I by exhaustive searching . Thus try to find an efficient algorithm for this problem using some….
I need to compare these four functions but I am not sure how to prove it.
ifyou for obtaining the shortest suchtour except I by exhaustive searching . Thus try to find an efficientalgorithm for this problem using some reasonable heuristic1. 10 Consider the following functions of nfin )$ 2 ( n )+ 100On$ 3 ( 1 )n if his oddIn 3 if n is evenn if n 5 100fall ) = 1 3 if n > 100Indicate for each distinct I pair i and j whether fi ( n ) is Of ; ( ) ) andwhether fin ) is Of ; ( n ) )