Determine whether the series is convergent or divergent by expressings as a telescoping sum. If it is convergent, find its sum. 14 2-1 n²+2n ① diverges iMo 1 14 2 21 21 2

Determine whether the series converges; if so, find its sum. If the series diverges, indicate that with the checkbox. NOTE: Enter the exact answer as improper fraction if necessary. 4 4k k=1 5k The series diverges. ||

We consider the Traveling Salesman Problem with the cost matrix 0 87 1 5 1086 3 7 10 15 9 2 70 5 8 2620 and apply Little's branch and bound algorithm. What is the initial lower bound on possible solutions at the very first step of the algorithm? Which edge (which entry of the cost matrix) is used for the first inclusion/exclusion branching? Enter the indices of vertices at both end points of this edge without any separators between them. (For example,if the edge (12) (or,in other words,the matrix entry c12) is chosen for inclusion/exclusion, enter 12 in the text box.) What is the lower bound on the solutions in the exclusion branch (after the fırst inclusion/exclusion branching)?