Following question is based upon analogy. There are two pairs of letter combination in each question. The first (left hand side) pair has some relationship between its members. In the second pair, one member is missing. Find this out from the options such that this pair has similar relationship as the first pair.
DRIVEN : NEVIRD :: BEGUM : ? |
|||||||
(a) |
EBGMU |
(b) |
MUGEB |
(c) |
MEUBG |
(d) |
UGMEB |
Following question is based upon analogy. There are two pairs of letter combination in each question. The first (left hand side) pair has some relationship between its members. In the second pair, one member is missing. Find this out from the options such that this pair has similar relationship as the first pair.
DRIVEN : NEVIRD :: BEGUM : ? |
|||||||
(a) |
EBGMU |
(b) |
MUGEB |
(c) |
MEUBG |
(d) |
UGMEB |