You are given an integer array a of size $4$ and an integer array b of size at least $4$.

You need to choose four indices $i_0, i_1, i_2,$ and $i_3$ such that $0 \leq i_0 < i_1 < i_2 < i_3 <$ b.length.

The score of the chosen indices is defined as:
$`a[0] \cdot b[i_0] + a[1] \cdot b[i_1] + a[2] \cdot b[i_2] + a[3] \cdot b[i_3]`$

Return the maximum score you can achieve.

Constraints:

• a.length $= 4$

• $4 \leq$ b.length $\leq 10^5$

• $-10^5 \leq$ a[i], b[i] $\leq 10^5$

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.