Consider a complete graph $G$ with vertex set $\{0, 1, 2, 3, 4\}$. Let $W$ be the matrix of edge weights of $G$, e.g., entry $W_{ij}$ in matrix $W$ is the weight of edge $\{i, j\}$. What are the minimum possible cost of a spanning tree $T$ of $G$?