Given a string formula representing a chemical formula, return the count of each atom.

An atomic element always begins with an uppercase letter, optionally followed by zero or more lowercase letters.

One or more digits representing that element’s count may follow if the count is greater than $1$. If the count is equal to $1$, no digits will follow.

A formula placed inside parentheses followed by a count (also optionally omitted if equal to $1$) is also a valid formula.

Return the total count of each atom as a string where elements are sorted in lexicographical order, followed by their count (if greater than $1$), followed by the next element name in sorted order, and so on.

Constraints:

• $1 \leq$ formula.length $\leq 1000$

• formula consists of English letters, digits, '(', and ')'.

• formula is always valid.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.