According to me if we apply Prim's algorithm then we will get <ab> = 6 because if we start from 'a' we will choose -2 and reach 'c' and then if we choose 5<ed> among 5<ed> and <ab> then obviously <ab> should be greater than 5. So, according to me, the minimum should have been 6. But the answer says something else.
