Recall the problem of deciding whether the brackets in a string are corrected nested that we used to motivate our discussion of stacks. We saw some code for the algorithm that solves the problem in the practical in Week 4 and this is written again in ADSAssignmentQ5.ipynb. Now consider a string such as *()][{*] and the question: can you replace the asterisks with brackets in such a way that a sequence of correctly nested brackets is obtained? The answer is yes since you can replace the first asterisk with [ and the second with } to obtain [()][{}] but given the string [({}*]]* there is no way to obtain a correctly nested sequence by replacing the asterisks with brackets. This question requires you to create a python function brackets that implements an algorithm (that you must devise) that given a string containing brackets and asterisks returns true or false according to whether it is possible to replace the asterisks with brackets to obtain a sequence of correctly nested brackets. You should aim to make the algorithm as efficient as possible.