E$.$g$.$: If we have the $3$ symbols below, and their respective uses:

used $5$ times.

used $2$ times.

used $9$ times.

Given that they add to a total use of $16,$ their frequencies will be:

$0\mathrm{.}3125(\frac{5}{16})$

$0\mathrm{.}125(\frac{2}{16})$

$0\mathrm{.}5625(\frac{9}{16})$

A static method called "sortSymbols$()"$

Takes in a Symbol array as input and returns no output.

It sorts the symbols by descending frequency $($i$.$e$.$: the symbol with the highest frequency must be in the $0-$th index and the symbol with the lowest frequency must be in the last index$).$

In the previous eximple, the symbols would have been sorted as such:

$(0\mathrm{.}5625)$

$0(0\mathrm{.}3125)$

$0=(0\mathrm{.}125)$

If two symbols have the same frequency, they must be sorted by ascending codepoint value $($i$.$e$.$: a symbol with a lower codepoint value must come before a symbol with a higher codepoint value$).$

See the table below to determine the ordering of the symbols we'll be using. The table is already sorted in ascending order by its codepoints.

You may not use any built$-$in sorting methods or libraries. You must write the sorting algorithm yourself.

You can find the Bubble Sort algorithm in the slides for $1321$L$,$ under Module $5$ part $1.$

The main method.

Creates an array of Symbols $($called "symbols"$)$ of size $9$ and fills it up with $9$ Symbol objects using their overloaded constructor, with each Symbol object using one of the characters in the order they appear below:

$\backslash$table$[[$Symbol$,$Codepoint$],[,$lu$221$E$],[(4),$lu$263$A$],[9,$lu$2640],[0,$lu$2642],[4,142660],[4,$lu$2663],[v,142665],[+,$lu$2666],[$d$,142668]]$