A string $S$ made of uppercase English letters is given. In one move, six letters forming the word

"BANANA" $($one $\text{'}$B$\text{'},$ three $\text{'}$A$\text{'}$s and two $\text{'}$N$\text{'}$s$)$ can be deleted from S$.$ What is the maximum

number times such a move can be applied to $S?$

Write a function:

function solution$($S$)$;

that, given a string $S$ of length $N,$ returns the maximum number of moves that can be applied.

Examples:

Given $S=$ "NAABXXAN", the function should return $1.$

Given $S=$ "NAANAAXNABABYNNBZ", the function should return $2.$

$1$

NAAXNABYNBZ

Given $S=$ "QABAAAWOBL", the function should return $0.$

Write an efficient algorithm for the following assumptions:

$N$ is an integer within the range $[1.\mathrm{.}100,000]$;

string S is made only of uppercase letters $(A-Z).$

Solution in typescript please. Thank you