The graph G on $10$ vertices is constructed from two $($vertex$-$disjoint$)$ paths on $5$ vertices in such a way that we connect each vertex of one path with every vertex of the other path. At most how many edges can a trail in G contain?