Term t(2020, 1) in Pascal's Triangle is equal to:

Which of the following terms in Pascal's Triangle equals t(6,5)?t(6,1)t(4, 2)t(6,0) and t(6,6)t(6,1) and t(4, 2)

Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:

Write a program to print Pascal's Triangle.Input: 6Output: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 Input format :The input consists of a number.Output format :The output displays the required pattern.Sample test cases :Input 1 :6Output 1 : 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 Input 2 :2Output 2 : 1 1 1

Write a C program to implement Pascal's Triangle generation and manipulation functionalities using functions and structures. Your program should provide the following capabilities: ·      Generate Pascal's Triangle: Implement a function to generate Pascal's Triangle up to a specified number of rows.·      Display Pascal's Triangle: Implement a function to display the generated Pascal's Triangle in a readable format.·      Calculate Column Sum: Implement a function to calculate the sum of all values in a specified column of Pascal's Triangle.Pascal triangle is constructed using the following rules:·      The first and last elements of each row are always 1.·      Each element in the interior of the triangle is the sum of the two elements directly above it in the previous row.Instructions:·      Define a structure named "Triangle" to represent Pascal's Triangle.·      Implement functions to perform the operations mentioned above. Use appropriate function prototypes and definitions.·      Use dynamic memory allocation to allocate memory for the triangle array based on the number of rows.·      Ensure error handling for invalid input values and memory allocation failures.·      Document your code with comments to explain the purpose of each function and significant code blocks. Note: Pascal's Triangle can grow rapidly in size, so consider efficiency and memory usage while implementing the generation and manipulation functions.

The recurrence T(n) = 2T(n-1) + n, for n≥2 and T(1) = 1 evaluates to