chap data structures and algorithms terms of its input and output then define two different physical representations for strings define an adt for list of integers firstdecide what functionality your adt should provide example should give you some ideas thenspecify your adt in java in the form of an abstract class declarationshowing the functionstheir parametersand their return types briefly describe how integer variables are typically represented on computer (look up one' complement and two' complement arithmetic in an introductory computer science textbook if you are not familiar with these why does this representation for integers qualify as data structure as defined in section define an adt for two-dimensional array of integers specify precisely the basic operations that can be performed on such arrays nextimagine an application that stores an array with rows and columnswhere less than , of the array values are non-zero describe two different implementations for such arrays that would be more space efficient than standard two-dimensional array implementation requiring one million positions imagine that you have been assigned to implement sorting program the goal is to make this program general purposein that you don' want to define in advance what record or key types are used describe ways to generalize simple sorting algorithm (such as insertion sortor any other sort you are familiar withto support this generalization imagine that you have been assigned to implement simple sequential search on an array the problem is that you want the search to be as general as possible this means that you need to support arbitrary record and key types describe ways to generalize the search function to support this goal consider the possibility that the function will be used multiple times in the same programon differing record types consider the possibility that the function will need to be used on different keys (possibly with the same or different typesof the same record for examplea student data record might be searched by zip codeby nameby salaryor by gpa does every problem have an algorithm does every algorithm have java program consider the design for spelling checker program meant to run on home computer the spelling checker should be able to handle quickly document of less than twenty pages assume that the spelling checker comes with dictionary of about , words what primitive operations must be implemented on the dictionaryand what is reasonable time constraint for each operation