Let S be the set of all strings of length $5$ over the binary alphabet $\{0,1\}.$ Let us define a binary on S

relation R as follows: Two strings s$1$ and s$2$

are in relation R$,(($s$1,$ s$2)$ in R$)$ if and only if s$1$ and s$2$

have the same number of characters $1.$ What decomposition of the set S does the equivalence of R induce? Describe it