From the table below, each group needs to:

$1.$ Choose a System: Select one of the systems $/$applications listed in the table below for design and development, along with its corresponding data structure model.

$2.$ Apply Algorithms: Implement the following list of algorithms on the selected system$/$application data. All listed algorithms must be applied. You can use any type of below algorithm but you need to apply all of them. i$.$e$.,$ for the Sorting algorithm, you can choose Merge sort or Bubble sort...etc.

a$.$ Insertion Algorithm

b$.$ Deletion Algorithm

c$.$ Traversal Algorithm

d$.$ Searching Algorithm

e$.$ Sorting Algorithm

$3.$ Analyze Complexity: Provide an analysis of the complexity of each algorithm applied.

Systems$/$Applications Data structure models

Task Management System Singly$/$Simple Linked List

Phone Book Application

Library Book List

Student Enrollment System

Student Attendance Tracker

Word Dictionary

Browser History Navigation Doubly Linked List

Text Editor with Undo$/$Redo

Image Viewer Application

Round$-$Robin Scheduling System

Multiplayer Game Lobby

Circular Playlist Manager

Multiplayer Game Queue System Doubly Circular Linked List

Customer Service Callback System

Circular Buffer for Data Storage

Circular Train System

Expression Evaluator Stack

Undo Functionality in Text Editor

Memory Management in Operating

Systems

Browser History Management

Customer Service Management System Queue

Print Job Management System

Message Queuing Systems

Web Server Request Handling

Call Center Management System

Circular Buffer for Streaming Data Circular Queue

Printer Job Management System

Audio Buffering System

Resource Pool Management

City Map Navigation System Graph

Network Routing System

Telecommunications Networks System

Flight Reservation System

Organizational Chart Tree

File System Structure

Binary Search Tree for Searching

Binary Search Tree for Searching