this is a Graph Theory class question. Please help with part A, B, C and D. Thank you so much!

3. Let us consider a variation of the Traveling Salesperson Problem. In this variation there is an office and 2k cities to be visited, where k is an integer. There are two salespersons each of which must begin and end at the office and visit exactly k cities. Between the two salesperson every city must be visited. There is a cost associated with going between any two cities and between the office and a city. (a) Determine a solution for the following weighted graph. office 20/8 1 15 2 16 12 10 1418 (b) Create a heuristic algorithm to estimate the solution for any instance. (c) Demonstrate your algorithm using the graph in part a. (d) What are some strengths/weaknesses of your algorithm