5. Answer any one of the two following problems (a) The following sequence was generated by a linear feedback shift register. Determine the recurrence that generated it. 1,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1,0,0, 0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1, 0,0,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1,0,0,0,0,1,0,0,1,1,0,0,1,0 You can use a self written program to solve this problem. You should feel free to use in built routines to compute determinants, inverses, etc. Provide the code with appropriate comments, explaining what you are doing. (b) Determine if the affine cipher (on 26 alphabets) has perfect secrecy. Justify your