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

the answer is c just got it on ed

step-by-step explanation:

step-by-step explanation:

ok one would be money, and the other would be refreshments or something similar. if each bag of popcorn is 5.00 and each drink is half of that that means drinks are 2.50 the proper way to do that would to look and see how much of each you can buy without exceeding a limit of 30.00

a

step-by-step explanation:

when a number is between two straight lines it means the absolute value.

to find absolute value you need to know how many numbers is that number away from 0.

when finding absolute value the number will always come out positive

so absolute value of -3 is 3

absolute value of 3/2 is 3/2

absolute value of -2 is 2

absolute value of 3.5 is 3.5

absolute value of -1 is 1

now put these numbers in order:

a)   |-1|, |3/2|, |-2|, |-3|, |3.5|

25.3

step-by-step explanation:

1st step

add 3+6

=9

multipy 9*3

=37