Planar Graphs · Medium problem

A network has $5$ "north" hubs and $6$ "south" hubs. Every north hub connects to every south hub, and there are also $2$ extra direct connections between pairs of north hubs. If this network (now $32$ edges on $11$ vertices) is to be drawn with no crossings, by how many edges does it exceed the correct planar maximum?