Minimum Number of Bits Required for Two's Complement Form (from Hexadecimal)

I know that I am supposed to use the form [-2^N, 2^N - 1] and add 1 to the exponent to get the answer. But I don't know why the below equation is true.

howManyBits(0x80000000) = 32