You are given a list of N transfers from $0$ to N$-1$ between two banks: bank A and bank B$.$ The K$-$th transfer is described by two values:

$$ R$[$K$]($either $$A$$ or $$B$)$ representing the recipient $($the bank the transfer is sent to$)$;

$$ V$[$k$\}$ denoting the

$$ value sent in the wire;

All transfers are completed in the order they appear on the list. The banks do not want the balances to fall below zero. What minimum initial account balance is each bank is necessary in order to complete the transfers?

Write the function

Def solution$($R$,$ V$)$

That gives a string R and an array of integers V both he length of N returns an array of two integers. The integers should represent a minimum initial account balance for banks A and B in the following order $[$bank A$,$ bank B$]$

Result array should be returned as an array of integers.

Write an efficient algorithm for the following assumptions:

$$ String R and array V are both of length N;

$$ N is an integer in the range of $[1..\mathrm{.}100,00]$

$$ Each element of the array V is an integer within the range of $[1..\mathrm{.}10,000]$

$$ String R is made only of characters $$A$$ and$/$or $$B$$