PLEASE ANSWER FAST FOR AN INSTANT UPVOTE

4. [10 pts) Let n > 3 be a natural number. Consider Kn, a network of delivery trucks with n delivery locations. For every (unordered) pair of locations, there is one truck that traverses between them (both ways). To cut costs, the shipping company wants to get rid of some of the trucks. (a) Let k be the minimum number of trucks that must be removed from Kn such that the resulting network has no cycles, but it is still possible to go from any location to any other location through a series of trucks. Determine the value of k as an expression in terms of n. Then indicate how to remove the minimum number of trucks of K, to accomplish the goal. (b) As an alternative way to cut costs, the company considers removing some of the shipping locations. Let l be the minimum number of locations that must be removed (recall that removing a location removes the trucks that travel to them) such that the new network has no cycles but it is still possible to travel from any location to any other location through a series of trucks. Determine the value of l as an expression in terms of n. Then indicate how to remove the minimum number of trucks of K, such that the goals are fulfilled