You have three batteries, with 4200, 2700, and 1600 mAh (milli-Amp-hours), respec-tively. The 2700 and 1600-mAh batteries are fully charged (containing 2700 mAh and1600 mAh, respectively), while the 4200-mAh battery is empty, with 0 mAh. You havea battery transfer device which has a "source" battery position and a "target" batteryposition. When you place two batteries in the device, it instantaneously transfers asmany mAh from the source battery to the target battery as possible. Thus, this devicestops the transfer either when the source battery has no mAh remaining or when thedestination battery is fully charged (whichever comes first).But battery transfers aren’t free! The battery device is also hooked up to your phoneby bluetooth, and automatically charges you a number of cents equal to however manymAh it just transfered. The goal in this problem is to determine whether there exists a sequence of transfersthat leaves exactly 1200 mAh either in the 2700-mAh battery or the 1600-mAh battery, and if so, how little money you can spend to get this result.(a) Rephrase this is as a graph problem. Give a precise definition of how to model this problem as a graph, and state the specific question about this graph that must be answered.(b) What algorithm should you apply to solve this problem?

Advantages and disadvantages of binary system

What type of computer network ensures high security ?

We as humans write math expression in infix notation, e. g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i. e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix. write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';