(a) Explain the differences between stack and queue data structures in terms of their operations, memory organization and real-life applications…

(a) Explain the differences between stack and queue data structures in terms of their operations, memory organization and real-life applications. Provide one example use-case for each.

(b) Given the following array of integers: A= [45, 23, 11, 89, 77, 98, 4, 28, 65, 43]

(i) Demonstrate how the array is sorted step-by-step using the quick sort algorithm (Choose the first element as pivot).

(ii) Show the contents of the array after each major partitioning step, and

(iii) Determine the average-case time complexity of Quick Sort algorithm and justify your answer.

(c) Explain the concepts of Entity-Relationship (ER) modeling and normalization in database design. How do these processes help in minimizing data redundancy and ensuring data integrity?