C ++ Project

Description: Your program receives from user two strings of symbols: first long one and then short one. Then your program returns all positions in long string where short string occurs as a substring. For example: long string is "aabcccbabc" and short one is "abc". Short string can be seen twice in the long string "aabcccbabc" in positions 1 and 7 (enumeration of positions in string starts as always from 0). Position of the substring is the position of its first symbol in the whole string. Requirements: 1) Your program invites user to enter long string. 2) Program gets the long string from user. 3) Your program invites user to enter short string. 4) Program gets the short string from user. 5) If the length of the short string is larger than the length of the long string then repeat steps 1-5. In other words, force user to reenter both strings again and again untill long string is finaly longer or as long as the short string. This step will require you to compute the lengths of both string. Your should do it yourself. You are NOT allowed to use build-in tools for finding string length (like strlen() ) 6) Output the line "The occurances were found in the following positions: " and then from the new string you list all the positions separated by space. If nothing was found then instead of list of positions message "Required substring was not found". 7) If at least one occurance of short string was found in the long string output the total number of occurances in the following format on the separate line "Total number of occurances is #number_of_occurances" Additionally: Your programming stile also will be evaluated. In case the program is written hard-to-read way it will affect your grade. Pay attention to the following things: - Parts of the program are separated by empty lines. - For each loop it is easy to see the beginning and the end of it. - Variable names are somewhat meaningful. - Comments are included. Executed in .cpp file