Week 2: Thursday
----------------

Q1. (40)

Input a positive integer m from the user. Print all the
terms of the Fibonacci series that are less than m. The
Fibonacci series is as follows: the nth term is the sum of
the (n-1)th term and the (n-2)th term, i.e., F(n) = F(n-1) +
F(n-2). The first two Fibonacci numbers are 1 and 1, i.e.,
F(0) = 1 and F(1) = 1. Print also the sum of all the terms
that have been printed.

Example: If m = 10, print 1 1 2 3 5 8 and sum is 20.

Q2. (60)

Input a positive number m (as double) and find its square
root.  Use the Newton-Raphson method for finding
successively better approximations to it.  In this method,
the approximation in the next step (denoted by X(n+1)) is a
function of the approximation in the current step (X(n)),
i.e., X(n+1) = f(X(n)).  For square root, the estimates are
updated as:
X(n+1) = X(n)/2 + m/ (2 * X(n))
Assume that the first term is m, i.e., X(0) = m.

Continue the estimation till the difference between two
successive approximations is less than 0.01. Print the
square root thus obtained.

Finally, compare your value with the value obtained using
the sqrt() function. Print the difference also.