1. Implement the following pattern using ragged array.

1 12 123 1234 12345

--------2. Implement Linear Search operation. 3. Implement the concept of bubble sort through modified bubble sort. 4. Write a program to check whether two methods are anagrams. Two words are anagrams if they contain the same letters in any order. For example, silent and listen are anagrams. 5. Write a program to check whether a string is palindrome or not. 6. Write a program that finds the number of occurrences of a specified character in a string. 7. Write a program that counts the number of words in a text file. The file name is passed as command line argument. 8. Write a program that repeatedly prompts the user to enter a capital for a state. Upon receiving the user input, the program reports whether the answer is correct. Assume that 50 states and their capitals are stored in a two-dimensional array. It will display the total correct count.