Let be a dodecagon (-gon). Three frogs sit at and . At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is , where and are relatively prime positive integers. Find .
Math Problem Solving Skills 