Would you please tell me how to work that code on python? please sent me a correct code and screen short if you can.

*Please refer to the attached file*

1. Complete the following problem using concepts of STACK.
2. If you are using JAVA, you must include the main method as well which should test your other methods and print the outputs according to the tasks.
3. If you are using PYTHON, make sure your code has the methods invoked and proper printing statements according to the tasks.
4. Your program will take an arithmetic expression as a string input. For Example:

    

   • “1+2*(3/4)”

    

   • “1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14”

    

   • “1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14”

    

   Program

    

   Your program will determine whether the open brackets (the square brackets, curly braces, and the parentheses) are closed in the correct order.

    

   Outputs:

    

   Output 1

    

   1+2*(3/4)

   This expression is correct.

    

   Output 2

    

   1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

   This expression is NOT correct.

   Error at character # 10. ‘{‘- not closed.

    

   Output 3

    

   1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14

   This expression is correct.

   
   

   Output 4

    

   1+2]*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

   This expression is NOT correct.

   Error at character # 4. ‘]‘- not opened.

   Task 1

   Solve the above problem using an array-based stack.

    

   Task 2

   Solve the above problem using a linked list-based stack.

Using Hadoop for historical sales data analysis 

Use this dataset to analyze various aspects of transaction 

1) Average unit_price by country for a given item type in a certain year

2) Total units_sold by year for a given country and a given item type

3) Find the max and min units_sold in any order for each year by country for a given item type. Use a custom partitioner class instead of default hash based.

4) What are the top 10 order id for a given year by the total_profit 

Please help in doing  above analysis working on a Hadoop system using map reduce code, written either in Java or Python.  Data preparation steps can be done as required before running a MapReduce job to answer  questions above. 

Dataset:

29. Consider the Cocktail Sort (code 4) algorithm described in the appendix. What is the fewest number of lines of code that would have to be added, removed, or changed in order for this algorithm to sort from largest to smallest? (A) Everything inside the second for loop. (B) 3 (C) 1 (D) 2 (E) Everything inside both for loops. Binary answers For the following questions you are to use your choices as they were the representation of a binary number. More precisely, A = 24, B = 23, C = 22, D = 21, and E = 20 position in a base 2 number. For example if you wanted to answer the number 23, you would translate it first as base 2 number, which is 10111, you would blacken A, C, D and E.2 Lets look at this process on your answer sheet, we have these 5 circle you can blacken. Normally you only pick one, here you might have to blacken more than one! @ ® © D ® Following the previous example, the answer we want to input is 23, its binary representation is 10111, hence the circle you would blacken are the following: