Before revision:  We show that C= C, by converting these problems into a corresponding Dynkin game  .
After revision:  We show that C= C, by converting these problems into a corresponding Dynkin game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games .