The question should be done in C++, please give explanation and running result. 1. For this question, we need to provide more information about where the mismatch of the text file is happening.  Write a recursive function called list_mismatched_lines that takes 2 filenames as input arguments and displays to the screen all mismatched lines in those files. This function should use hashing techniques and shall not compare strings to detect mismatch.  The signature of this function should be: void list_mismatched_lines(std::string file1, std::string file2);  In file1.txt, it contains "My dear C++ class. I hope that you enjoy this assignment. " In file2.txt, it contains "My dear C++ class. I hope that you like this assignment. " Example: Running the following line of code, should print to the screen the mismatched lines only, from both files. list_mismatched_lines(file1, file2);  The following output should be seen on the screen:  file1.txt: I hope that you enjoy this assignment.file2.txt:…

Convert the following infix expression into a post fix expression using stack and write the justification at each stage A+B*C/D/E*F+G-H

Do in c++ ,dont use built in functions , dont use extra libraries, create your own stack and queue dont use built in stack and queue.

C++ NOTES FROM MY TEACHER: okay, first your gonna need to set your curPtr to null. Otherwise, the while is just not going to run. I'm assuming your next is the new head pointer so u should be setting that to the tail pointer since you are reversing. I suggest u change the parameters to loop through the entire list, so u might want to create a variable that goes from 0 to the end of your list and increases every time the while is running and will stop once it gets past the item count otherwise it's going to go on forever. Also put some if statements inside the while for cases where it the beginning of the list, end of the list, and in between the list ur gonna need those because, since its a doubly-linked list, ur also going to have to change the pointers to and from the Null pointers   Please help me fix my reverse function C++

Write a C++ function that takes two integer arrays and adds each element of both arrays using pointers not by index and function must check the array size to ensure same number of elements.

How do I code the following stack in C program?

Need the above solution using list comprehension

Explain how the reference count garbage collection works? Which limitation is removed using TBD stack and how?

1) - Write a Python function that will receive a list as an argument.  A) The function will receive a list of at least 5 numbers as a single argument when the function is called. B)The function will ask the user to input a number and will find and return the index of that number in the list. C). If the number is not an element of the list, the function returns the string "unknown" and asks the user to try again. There can be a total of 3 possible failed trials, after which the program will return a message to the user and exit. Choose your own exit message.