A large queue of N potential partners is waiting at your door, all asking to marry you. They have arrived in random order. As you meet each partner, you have to decide on the spot, based on the information sofa, whether to marry them or say no. Each potential partner has desirability dn, which you find out if and when you meet them. Oust marry one of them, but you are not allowed to go back to anyone you have said no to. There are several ways to define the precise problem.(a) Assuming your aim is to maximize the desirability dn, i.e., your utility function is d^n, where ^n is the partner selected, what strategy should you use?(b) Assuming you wish very much to marry the most desirable person(i.e., your utility function is 1 if you achieve that, and zero otherwise);what strategy should you use?