Write an interactive java program for evaluating postfix expressions. The program will allow the user to enter a postfix expression from the keyboard. Assume the expression is entered correctly. Output to the screen the stack evaluation (showing the stack) after each step and final expression value. Finally, promptthe user if he/she wishes to perform another calculation or quit the program. Check case. The program must use a stack data structure. Refer to the sample output below. Sample Run:Enter a postfix expression: 4 5 2 * + Stack Contents: After push operation: 4 After push operation: 4 5 After push operation: 4 5 2 After * operation: 4 10 After + operation: 14 Final Value: 14 Enter another expression (Y/N)? y Enter an infix expression: 5 7 + 6 2 - * Stack Contents:After push operation: 5 After push operation: 5 7 After + operation: 12 After push operation: 12 6 After push operation: 12 6 2 After - operation: 12 4 After * operation: 48 Final Value: 48 Enter another expression (Y/N)? N

Use stack as a data structure in creating a program that enable to reversed the inputstring.Create a java program that asks a user to input student’s full name and reverses the string.The program should be able to print how the string is reversed and display the reversed string. The program should display one by one on how to reverse the string and then display the final output of the reversed string.

Complete the missing code then compile, debug and test your program using the command lines below: c++ -o project1 project1.cpp <enter> ./project1 n m k <enter> Where n is the size of the stack, m is the modular of the real part and imagination part of a random complex number, and k is the number of elements displayed per line. In the main function, you need to Get the values n, m, and k from the command line. Declare a complex number stack of size n, generate n random complex numbers and push them into the stack. Meantime display all these numbers, k numbers per line. Display all elements of the stack, k elements per line. Create two random complex numbers c1 and c2, display c1, c2 and the results of the addition c1+c2, the subtraction c1-c2, the multiplication c1*c2, and the division c1/c2. #include <iostream> #include <cstdlib> #include <ctime> using namespace std; class Complex {…

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…