Write a program in Python to show how a queue works using empty, size, front, back, push item onto queue, and push item off queue.

Write a Python code that can allow as to change the Fibonacci expression F(n,2,q) to F(n,k,q). where we can add any given number to the previous number. You can use any number as an example to demonstrate. Use queue class.

This program is about identifying palindromes. A palindrome is a list that reads the same forwardas backward. For example, [2, 5, 2] is a palindrome. [2, 5, 2, 2] is not a palindrome. Write a prologfunction, is_palindrome(X), that returns true if the list X is a palindrome, otherwise it returns false. Notethat an empty list is a palindrome.Examples:is_palindrome([1,1,3,1,1]) should return true.is_palindrome([1,3,1,1]) should return false.is_palindrome([1,3,3,1]) should return true.is_palindrome([a,b,l,e,w,a,s,i,e,r,e,i,s,a,w,e,l,b,a]) should return true.

Can you write a program in python for the dining philosopher problems that do not have deadlock? You have to use semaphores and use the strategy that a philosopher only picks the fork if both (left and right) are available. def philosopher(id: int, fork: list): The main is if __name__ == "__main__": semaphoreList = list() #this list will hold one semaphore per fork Philosophers = 5 for i in range(Philosophers): semaphoreList.append(multiprocessing.Semaphore(1)) philosopherList = list() for i in range(Philosophers): #instantiate all processes representing philosophers philosopherList.append(multiprocessing.Process(target=philosopher, args=(i, semaphoreList))) for j in range(Philosophers): #start all child processes philosopherList[j].start() for k in range(Philosophers): #join all child processes philosopherList[k].join() sample output: DEBUG: philosopher2 has chopstick2 DEBUG: philosopher2 has chopstick3 DEBUG: philosopher2 eating DEBUG: philosopher1 has chopstick1 DEBUG: philosopher0…