Suppose we need to write an efficient program to store N employee records for ABC Inc where each employee record is identified by unique employee id. Consider the following ways to store the records. An array list sorted by employee id A linked list sorted by employee id A linked list not sorted A balanced binary search tree with employee id as key For data structure 1 -4, what is the average time to find an employee record given employee id as a key?