in c languge please!!

12.3 P3 - Ex1: Substrings Compute and output the number of ways in which we can choose two identical non-overlapping substrings of a given string read from the user Constraints Read the string from the user. The given string will consist only of lowercase English letters (a-z). The length of the given string will be between 1 and 50, inclusive. . . Output your result using the following format'%d ". Example 1 When the input is Output must be Example 2 When the input is aba Output must be Example 3 When the input is abab Output must be LAB ACTIVITY 12.3.1: P3- Ex1: Substrings 0/65