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?