How can you drop two eggs the fewest amount of times, without them breaking?

May consider a group  g=({0,1},+)g=({0,1},+)where  ++  will work as the xor operator like we work in boolean algebra. note here, that ‘00’ and ‘11’ are not the usual 0 and 1 that we work with everyday. the elements are  called  ‘00’ and ‘11’ and  may not mean  zero (nothing) and one (single). ‘00’ is the identity for the given binary operator +, meaning that any element operated with ‘00’ gets us that element itself.  for a set  ss  in  g′g′  having more elements than just  {0,1}{0,1}  the values for  a+b∈sa+b∈s, such that  a∈s,b∈sa∈s,b∈s, have to be first defined, only then can you determine the value of  1+11+1. the answer could possibly have been  22  if oanswer is25,000

Answer(12) judaism; ans(11) all of the above; //ans(10) islands that are artificially created; //ans(9) people accept that the caste system keeps order in society and prevent chaos; ///ans(8),brahman; ans(7) the sikhns; ///ans(6); the non-cooperation movement; asn(5)sporadically grant congressional requests; /ans(4) all of the above; ///ans(3) true; //ans(2) true; //ans(1) false;