Show the action of the Kuhn-Munkres algorithm in finding a maximum-weight perfect matching for the weighted complete bipartite graph corresponding to the following. (Options cut off due to character limit)

A) It minimizes the matching weights.
B) It maximizes the matching weights.
C) It creates a random matching.
D) It ignores the weights in matching.