Combine the two codes to make work properly

#include using namespace std; int main() int countPositive0, countNegative0 int count -0, total0, num; cout > num; while (num != 0) if (num > 0) countPositive++; else if (num > num; if (count 0) cout using namespace std; // The function for finding the solution to ove n disks // from A Tower to B Tower with help of C Tower void moveDisks(int n, char TowerA, char TowerB, char Buffer) if (n -1) // stopping condition cout > n; // Find the solution recursively cout