which notation provides strict upper bound for ( )(aomega notation (bbig notation (csmall notation (dtheta notation which notation comprises set of all functions (nthat are greater than or equal to cg(nfor all values of > (aomega notation (bbig notation (csmall notation (dtheta notation function in ( notation is ( (bn (cn / (dn true or false trees and graphs are the examples of linear data structures queue is fifo data structure trees can represent any kind of complex relationship between the nodes the average-case running time of an algorithm is an upper bound on the running time for any input array is an abstract data type array elements are stored in continuous memory locations the pop operation adds an element to the top of stack graphs have purely parent-to-child relationship between their nodes the worst-case running time of an algorithm is lower bound on the running time for any input in top-down approachwe start with designing the most basic or concrete modules and then proceed towards designing higher-level modules ( ( )comprises set of all functions (nthat are less than or equal to cg(nfor all values of > simply means same as best case small omega notation provides an asymptotically tight bound for ( theta notation provides non-asymptotically tight lower bound for ( ( fill in the blanks is an arrangement of data either in the computer' memory or on the disk storage are used to manipulate the data contained in various data structures in the elements of data structure are stored sequentially of variable specifies the set of values that the variable can take tree is empty if abstract means the time complexity of an algorithm is the running time given as function of analysis guarantees the average performance of each operation in the worst case the elements of an array are referenced by an is used to store the address of the topmost element of stack the operation returns the value of the topmost element of stack an overflow occurs when is fifo data structure the elements in queue are added at and removed from if the elements of data structure are stored sequentiallythen it is is basically set of instructions that solve problem the number of machine instructions that program executes during its execution is called its specifies the expected behaviour of an algorithm when an input is randomly drawn from given distribution the running time complexity of constant time algorithm is given as complex algorithm is often divided into smaller units called design approach starts by dividing the complex algorithm into one or more modules case is when the array is sorted in reverse order notation provides tight lower bound for ( the small notation provides tight upper bound for ( ____ (