In general 2^n is the number of pieces of information n bits can store.
(a) Antonio can use the formula 2^n-1 to indicate the maximum size of numbers an n-bit word can store.
(b) for a 16-bit system, the maximum number of keys Millie can collect is 2^(16)-1 = 65536-1=65535
(c) For a 14 byte program, there are 14*8=112 bits.
The answer is <span>Q=(M−2P)/3
</span>
<span>M = 2P + 3Q
Subtract 2P from both sides:
M - 2P = 2P + 3Q - 2P
M - 2P = 3Q
Divide both sides by 3:
(M - 2P)/3 = 3Q/3
(M - 2P)/3 = Q</span>
Just add the two bases plus the lateral area. so it would be 706.5+706.5+471.
