binary search coding

Create the following classes in C++. 1. Class 'lfsr' contains the following properties: a) An unsigned integer called the 'seed': (the seed value will range between 0 to 255) b) A reciprocal characteristic/feedback polynomial function: (the user will set the characteristic polynomial. Basically, the user will specify the bit-positions which your class will use to generate the random numbers. The bits in the LFSR state that influence the input are called taps) Add appropriate member-functions such as, a) Constructor(s) b) A function to print the seed and generated numbers (both in integer and binary number system). c) A function (named as ‘random_number_generator’) to create 20 consecutive random numbers from the given seed and the characteristic polynomial. d) Based on the requirements of the class, you might have to convert any given decimal number to a binary number and store it. So, you need to implement a function that converts a given decimal number to a corresponding binary number. 2. Class ‘binary_search_tree’ contains a root node of following type: struct tree_node { int data; struct tree_node *left_node; struct tree_node *right_node; } condition: