Question 3. Anawer the following question cenuidering the data trpe deworest betoe. Lists in LSP programming language can be considered an abstract data type. use has the ficloeioc few operators defined over lists: cons, car, car and ni. A list can be of any bustroe: 3a. How can we specify an ADT feomider two main components for the specticarions? 36. Write the first part of the specificabion for the dare type descritud anowe. Wos the sanuertion We described in ciass. 3c. Write the second part of the specification for the data type described above. Use the convention we described in class. SE341 Final Studeft if d. How would you implement such an ADT in Ct+? Describe the data representation as well as other implementation details. 3e. Assume that you have a programming language that does type inference. How would byoe inference work for the ADT above