please anwser this C# question using the C# programming language. thank you. If you could anwser all 5 parts that would be great!!! Need alot of help!!!

Write a console application to accomplish the following tasks. The methods you write should return the results to the client(main) and main should print the results with approprate labels. Use /II comments on all of your methods other than main 126-9, recall that mod % by 10 yields the rightmost digit write a method that when given a non-negative int n finds the sum of the digits recursively and returns the sum or the client to print. (126 % 1015 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). 1 NO LOOPS ex 2. Write a method that when given base and n that are both integers greater than or equal to 1, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3 squared). 3. We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Write a method that when given the number of rows, recursively computes (no loops or multiplication) the total number of blocks in such a triangle The Fibonacci sequence is a famous bit of mathematics, and it happens to have a recursive definition. The first two values in the sequence are 0 and 1 (essentially 2 base cases). Each subsequent value is the sum of the previous two values, so the whole sequence is: 0, 1, 1, 2, 3, 5, 8, 13, 21 and so on, write a recursive method, Fibonacci(n), that returns the nth Fibonacci number, with n=0 representing the start of the sequence. 4. 5. Write a non-recursive solution to Fibonacci using the same sequence and value. Answer the following: Which is more efficient and why? Your submission should include hard copies of your source code and at least the results of running the following data: For part 1: 317 and 19321 For part 2: 2,3 and 5,4 For part 3: 5 For part 4: 40