Show that if all weights in a connected graph g are distinc bhe wort 27 find positive integers a and a such that a 2a 1.- does not divide a, and the algorithm, with available deno inations 1, a. a2. produces the fewest umber of stamp make any given amount of postage. prowe that your value g has a unique minimal spanning tree. in exencises 14-16 decide f the saatemet is true or false. if the gonible statement iy ine, preve i oeherwise, give a counteresampie