added day 9 q2 solution

Author: MANISH-BEESA

Problems/Data-structures/Day-09/sol/BEESA-MANISH/Solution2.cpp

@@ -1,6 +1,6 @@
 /*
 
-Submission link: 
+Submission link: https://codeforces.com/contest/61/submission/356395307
 
 TC- o(n log n)
 SC - o(n)
@@ -12,12 +12,6 @@ Count bigger elements on the left and smaller elements on the right.
 Multiply these counts and sum for all positions to get the answer.
 */
 
-
-
-
-
-
-
 #include <bits/stdc++.h>
 using namespace std;