1.Write a program that fills a five-by-five matrix as follows:
Upper left triangle with +1s
Lower right triangle with –1s
Right to left diagonal with zeros
Display the contents of the matrix using not more than two printf statements
2. Selection sort is based on the following idea:
Selecting the largest array element and swapping it with the last array element leaves an unsorted list
whose size is 1 less than the size of the original list. If we repeat this step again on the unsorted list we will have an ordered list of size 2 and an unordered list size n–2. When we repeat this until the size of the unsorted list becomes one, the result will be a sorted list.
Write a program to implement this algorithm.