It should be fairly obvious to you (as seen from your two diagrams) that the maximum number of interior regions are generated when no three or more diagonals have a common intersection point. The proof is fairly simple for this. Now, we will consider the number of regions that are created when no three or more diagonals have a common intersection point. We show this by recursively adding an extra node:
Let the maximum number of interior regions in a convex polygon having $n$ sides be $f(n)$. For the base case, consider $f(4) = 4$, which is trivial.
Let us add an extra vertex $P_{n+1}$ to an $n$-sided polygon, to make it an $n+1$ sided polygon. It will have $n-2$ new diagonals originating from it. Let the vertices in the original polygon that are closest to the new vertex be labeled $P_1$ and $P_n$. Then, the side $P_1P_n$ is also a new diagonal in the new polygon. We note that once any of the new diagonal originating from the vertex $P_{n+1}$ enters the smaller polygon, when it moves from its intersection of any diagonal of the new polygon (including $P_1P_n$) to any other diagonal or termination vertex, it divides the region into two parts, thus creating an extra region. What this translates to is that the number of extra regions created inside the old polygon, is equal to the number of times any newly created diagonal originating from $P_{n+1}$ intersects another diagonal (including $P_1P_n$). The number of different ways this can happen can be found by fixing the ending point of the diagonal originating from $P_{n+1}$, and the possible ending points of the other diagonal. All three points will be among the vertices of the original polygon, i.e., among $P_1 ... P_n$. Thus, we have to choose 3 integers out of $1 ... n$, which is $n\choose3$.
Also note that the newly formed $\triangle$P_1P_nP_{n+1}$ will be divided into $n-1$ regions by the $n-2$ new diagonals originating from $P_{n+1}$. Thus, the total increase in regions is $n\choose3$+ (n-1)$, giving the recurrence relation:
$f(n+1) = f(n) + {n\choose3} + (n-1)$
Solving this recurrence relation gives the following closed form expression:
$f(n) = \frac{1}{24}n(n-3)[n(n-3) + 14] + 1$
Another solution giving identical (but expressed differently) result can be found here.