Circular Lists - C PROGRAM A linear list is being maintained circularly in an array c[0…n-1] with front, and rear set up as for circular queues. a) Write an algorithm to insert an element y immediately after the k-th element.

#include <iostream> using namespace std; #define SIZE 5   //creating the queue using array int A[SIZE]; int front = -1; int rear = -1;   //function to check if the queue is empty bool isempty() { if(front == -1 && rear == -1) return true; else return false; }   //function to enter elements in queue void enqueue ( int value ) { //if queue is full if ((rear + 1)%SIZE == front)    cout<<"Queue is full \n"; else {  //now the first element is inserted  if( front == -1)     front = 0; //inserting element at rear end rear = (rear+1)%SIZE;   A[rear] = value; } }   //function to remove elements from queue void dequeue ( ) { if( isempty() )  cout<<"Queue is empty\n"; else //only one element if( front == rear )  front = rear = -1; else  front = ( front + 1)%SIZE; }   //function to show the element at front void showfront() { if( isempty()) cout<<"Queue is empty\n"; else cout<<"element at front is:"<<A[front]; }   //function to display the queue void…

*Please using JAVA only*   Objective Program 3: Binary Search Tree Program The primary objective of this program is to learn to implement binary search trees and to combine their functionalities with linked lists. Program Description In a multiplayer game, players' avatars are placed in a large game scene, and each avatar has its information in the game. Write a program to manage players' information in a multiplayer game using a Binary Search (BS) tree for a multiplayer game. A node in the BS tree represents each player. Each player should have an ID number, avatar name, and stamina level. The players will be arranged in the BS tree based on their ID numbers. If there is only one player in the game scene, it is represented by one node (root) in the tree. Once another player enters the game scene, a new node will be created and inserted in the BS tree based on the player ID number. Players during the gameplay will receive hits that reduce their stamina. If the players lose…

Python Big-O Notation/Time Complexity Pls answer only if u know big-o Thanks!  Item #3.

EXERCISE 1 Consider a function doubles :: Cint]Eint] that doubles every item in list doubles [3, 4,1,2] [6,8, 2,4] a) write a version doubles Rec using recursion for the aboe function

Python data structures: write a function that takes in a list (L) as input, and returns the number of inversions. An inversion in L is a pair of elements x and y such that x appears before y in L, but x > y. Your function must run in -place and implement the best possible algoritm of time complexity.  def inversions(L: List) -> int:'''finds and returns number of inversions'''

Using C, Must be in C   Create a menu driven program that performs the following tasks (each task is a menu item):                            a. Create a doubly linked list of length 5 using dynamic allocation. Your linked-list should support method Write a function on to print the content of the linked list following its order. Write a function on to reverse the doubly linked list.  Write a function to Delete the first node in your doubly Linked list

Circular Lists - C PROGRAM A linear list is being maintained circularly in an array c[0…n-1] with front, and rear set up as for circular queues. a) Draft a formula/algorithm in terms of front, rear, and n for the number of elements in the list.