sec exercises (athe data field is eight bytesa pointer is four bytesand the array holds twenty elements (bthe data field is two bytesa pointer is four bytesand the array holds thirty elements (cthe data field is one bytea pointer is four bytesand the array holds thirty elements (dthe data field is bytesa pointer is four bytesand the array holds forty elements determine the size of an int variablea double variableand pointer on your computer (acalculate the break-even pointas function of nbeyond which the array-based list is more space efficient than the linked list for lists whose elements are of type int (bcalculate the break-even pointas function of nbeyond which the array-based list is more space efficient than the linked list for lists whose elements are of type double modify the code of figure to implement two stacks sharing the same arrayas shown in figure modify the array-based queue definition of figure to use separate boolean member to keep track of whether the queue is emptyrather than require that one array position remain empty palindrome is string that reads the same forwards as backwards using only fixed number of stacks and queuesthe stack and queue adt functionsand fixed number of int and char variableswrite an algorithm to determine if string is palindrome assume that the string is read from standard input one character at time the algorithm should output true or false as appropriate re-implement function fibr from exercise using stack to replace the recursive call as described in section write recursive algorithm to compute the value of the recurrence relation (nt(dn/ et(bn/ cnt( thenrewrite your algorithm to simulate the recursive calls with stack let be non-empty queueand let be an empty stack using only the stack and queue adt functions and single element variable xwrite an algorithm to reverse the order of the elements in