A stack can be implemented with an array A[0..N-1] and a variable pos. The push and pop operations are defined by the following code. push (x) A[pos] + x pos + pos - 1 end push pop ( ) pos + pos + 1 return A[pos) end pop Which of the following will initialize an empty stack with capacity N for this implementation?

You are going to be asked to make a singly-linked list of singly-linked lists. How are you designing your data structure to best facilitate this design? Be sure to explain how the data is internally stored within your linked list of linked lists. (PI 1.1/ABET[1], PI 6.1/ABET[6])   #Python

You are allowed to operate on a stack WORK and a temporary stack TEMP (ifneeded) supporting their ADT operations of PUSH (S,X), POP (S, X) andEMPTYSTACK (S) only, where X represents an element/variable to be pushed in orpopped out of the stack and S represents a stack. You are also permitted to use onevariable if needed to carry out the operations.i) Given n distinct random numbers that are to be pushed into WORK, how canyou find the minimum element that was pushed into it? You are permitted to use alone variable.ii) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.iii) Given an array A[1: n] of distinct random numbers how can you obtain thesorted list in the array, making use of stacks alone?

2.     For the code below, draw a picture of the program stack when the function partition() is called the 2nd time.   # extracted from suquant's reply at # https://stackoverflow.com/questions/18262306/quicksort-with-python def partition(array, begin, end):     pivot = begin     for i in range(begin+1, end+1):         if array[i] <= array[begin]:             pivot += 1             array[i], array[pivot] = array[pivot], array[i]     array[pivot], array[begin] = array[begin], array[pivot]     return pivot   def quicksort(array, begin, end):     if begin >= end:         return     pivot = partition(array, begin, end)     quicksort(array, begin, pivot-1)     quicksort(array, pivot+1, end)   # added calling code if __name__ == "__main__":     mylist = [8, 2, 17, 4, 12]     quicksort(mylist, 0, 4)