Antonio is a freelance computer programer. in his work , he often uses the power of 2^n to find the number of ways bits (or units of information) can be arranged. the n often stands for the number of bits. antonio is working on programing a new video game called  millie's quest . in the game the main character , millie. collects golden keys to her quest. antonio wants write formula to show that millie can collect one less key than the highest number of bits that can be arranged in the system. what formula can he use?