Racket:  Execute these lists: ( (lambda (x) (* x x)) 1) ( (lambda (x) (* x x)) 2) ( (lambda (x) (+ x x)) 3) ( (lambda (x) (- x x)) 4) ( (lambda (x) (/ x x)) 5) ( (lambda (x) (modulo x x)) 6) ( (lambda (x) (modulo (+ x 2) x)) 6)   Explain clearly what these expressions seem to mean

A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n):    if (n < 0 ):        return -1    else:        return n        fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2])    return fibonacci_numbers(n)   # TODO: Write…

in C++

in java pls and thank you!

Explore the stack's capabilities when allowed to be itself.

Select the statements that apply to the use of the frame pointer. EBP is often called the base pointer or frame pointer because it holds the base address of the stack frame. EBP does not changes value during the procedure. EBP need not be restored to its original value when a procedure returns. A procedure can explicitly access stack parameters using constant offsets from EBP.

Complete the following ():a. A stack is used by the system when a function call is madeb. A stack can become full during program execution

Simple JAVA queue code implementation please help for any part, please be clear, thank you Given an interface for Queue- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of Queue interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Wait in line – Queue (fifo)- Implement the provided Queue interface ( fill out the implementation shell)- Put your implementation through its paces by exercising each of the methods ina test harness- Add to your ‘BusClient’ the following functionality using your Queue-o Create (enqueue) 6 riders by name§ Iterate over the queue, print all riderso Peek at the queue / print the resulto Remove (dequeue) the head of the queue§ Iterate over the queue, print all riderso Add two more riders to the queueo Peek at the queue & print the resulto Remove the head & print the result§ Iterate over the…

This data structure provides a variety of benefits over others, such as a linked list or tree.

7. display a value at a specified index in a linked chain of integers For example, display the 3rd element in the chain, display the 10th element in the chain, etc. a.O(log n) b.O(n2) c.O(n) d.O(1) e.none of these is correct