In the 1-out-of-2 Oblivious Transfer protocol studied in the lecture, let Bob's secret bit be b = 0. Let p = 809, g = 3, x = 158. Bob receives co = (c00, c01) = (697, 716) and c1 = (c10, cl1) = (536, 360), all modulo p from Alice. Alice has two secret messages mo, mi. a) (1 mark) Which message can Bob retrieve? Omo Om1 b) (2 marks) How does Bob retrieve my? Oc00 / c01* Oc01/c00* Ocl1/c102 Oc10/cl13 c) (2 marks) What is the message mb? Note: just write as an integer