need help on a $4-$bit OFB TEA algorithm code. either in C$++$ or Java. able to encrypt these numbers$(5$ XR$18654877).$ Do Not Give Me Unworkable Codes.This part comprises three sections. Section $1.$ This task is to implement a $4-$bit OFB TEA algorithm using C$++,$ Java, or Python. See the co for TEA in the lecture notes. $(1$ mar Section $2.$ Encrypt your student number using $4-$bit OFB TEA algorithm as devised above. $(0\mathrm{.}5$ mark Section $3.$ Add all the digits of your student number mod $8.$ Let the result be c$.$ If c equals $4,$ then set c $6.$ Implement c$-$bit OFB TEA algorithm, and encrypt your student number using this algorithm. Compare the time needed to encrypt using $4-$bit OFB TEA algorithm and c$-$bit OFB TEA algorithm, a write your result in the PDF file. Explain what has happened. $(1$ mar