Write short note on top ten pattern

Pattern RepresentationMax Score: 100Given a pattern consisting only of 'I' and 'S', where I represents descending and S represents ascending, you need to display a sequence of numbers describing the ascending or descending order. Each character should be represented by 2 digits (between 1-9) - denoting the character's ascending or descending nature. The second character in the pattern takes the last digit from the first character to build the sequence. The third character in the pattern takes the last digit from the second character to build the sequence and so on. The sequence cannot have repeated digits. Find the smallest such sequence which represents the given pattern.Input FormatThe first line of input contains T - the number of test cases. It is followed by T lines, each containing a pattern, consisting only of 'S' and 'I'.Output FormatFor each test case, print the smallest sequence which represents the given pattern, separated by a newline.Constraints1 <= T <= 5001 <= len(str) <= 8ExampleInput4SISISIISSOutput1221132432145ExplanationExample 1:The given pattern has a single character 'S', which denotes ascending nature. There are multiple ways to represent it - 12, 47, 28, 34 etc. However, "12" is the smallest of them.Example 2:The given pattern has a single character 'I', which denotes descending nature. There are multiple ways to represent it - 21, 41, 75, 96 etc. However, "21" is the smallest of them.Example 3:The given pattern has 3 characters 'S' (ascending), 'I' (descending) and 'S' (ascending). There are multiple ways to represent it - 1324, 1634, 1435, 4812, 3748 etc. However, "1324" is the smallest of them.

Write a function top5_words(text) that takes a single argument text (a non-empty string), tokenises text into words based on whitespace (once again, without any stripping of punctuation or case normalisation), and returns the top-5 words as a list of strings, in descending order of frequency. If there is a tie in frequency at any point, the words with the same frequency should be sub-sorted alphabetically (e.g. if 'turtle' and 'grok' both occur 5 times, 'grok' should come first). If there are less than five distinct words in text, the function should return all words in descending order of frequency (with the same tie-breaking mechanism). For example:>>> top5_words("one one was a racehorse two two was one too")["one", "two", "was", "a", "racehorse"]>>> top5_words("buffalo buffalo buffalo chicken buffalo")["buffalo", "chicken"]>>> top5_words("the quick brown fox jumped over the lazy dog")["the", "brown", "dog", "fox", "jumped"]

Look at the sequence ଵଷ, ଶସ, ଷହ , ସ଺ , … , … ..Write down (a) the 10th term (1 mark)(b) the nth term

write a short note in UTXO in Bitcoin for 5 marks

Write the output of the following code :list(“welcome”)[‘w’, ‘e’, ‘l’, ‘c’, ‘o’, ‘m’, ‘e’](‘w’, ‘e’, ‘l’, ‘c’, ‘o’, ‘m’, ‘e’)[‘welcome’]None of the above