Determine an appropriate justification for how many different bit strings of length ten:

i) remain unchanged if it is reversed, ie first bit is like the last one, then the first one and the second last and so on., as is the case for example the strings 1011001101 and 0101111010.

ii) contains exactly two 1-bits must not be contiguous.

iii) contains either five consecutive 0-bits or five contiguous 1-bits.