In your second assignment, you are going to simulate a famous problem of self-avoiding walk that has many applications such as the study of polymers, statistical mechanics among many others. this is an open problem, yet to be solved by mathematicians and here you are going to confirm an intuitive solution to this problem.

before you start, we have a few bits and bobs to take care of. first, i want you to download the starter code that comes with this description. second, read the statements on top of the code and fill in the gaps by which you are actually signing an agreement. no assignment will be marked without having your signature on this part. finally, make sure that you do not change a single statement in this file. you are allowed to insert your code where it is marked by // insert your code here.

i recommend you to read this description once carefully and take a note, if required, to get a good understanding of the problem that you are going to solve. then take my lead to solve this problem by reading the final paragraph of this part. in that paragraph, i will be breaking down the problem for you to solve.

Amain idea is supported, explained, or expanded on with a numbers b. a concluding statement c. details d. a topic sentence. im e paragraphs reset nex next

We as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i.e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix.write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';

What are the 12 colors of the spectrum called?