Let g = (v; e; w) be an edge-weighted digraph. a branching of g is a subset b of e such that b contains no undirected circuit and such that for each vertex v there is at most one edge in b entering v. show that a branching of g with maximum total weight can be computed in polynomial time.