Graphs and Degrees · Hard problem

A conference has $12$ attendees, split into exactly $2$ nonempty discussion groups (every attendee in exactly one group). Within each group, every pair of attendees has a one-on-one meeting; there are no meetings across groups. What is the LARGEST possible total number of meetings, over all ways to split the $12$ attendees into $2$ nonempty groups?