Write in C++. Do not use arrays or strings.  

2. Happy Numbers: A number (>0) is called a happy number, if you start with the given number and arrive at 1 by repeating the following process (as illustrated in the below example): (a) compute the sum of the squares of given number digits (b) if the resultant value is 1, then the number is happy number, else execute point (a) for the newly produced number. Note that if a number is not a happy number, there will be an endless loop to this execution. Goal: In this question, you are required to write Function that checks whether the number entered by the user is happy number or not for 100 cycles/iterations only. Example: Assume a number 19 Number Computation 12 +92 82 +22 62 + 82 12 +02 +02 Result cycle/iterations 1 19 82 82 68 68 2 100 3 100 1 4 Stop computing further, as the Result obtained is 1. Hence, the number '19' , is a happy number. We achieved this in 4th cycles only. Function Prototype: bool isHappyNumber(int num); Example 01:** *marks: 02 Input: Number: 19 Output: Happy Number Example 02:** *marks: 02 Input: Number: 7 Output: Happy Number Example 03:*** Input: Number: 18 *marks: 02 Output: Sad Number Note: Take input and display output in main function.