Write a C++ program that implements Euclid's algorithm described in section zyBooks section 10.5 to find the greatest common divisor. Prompt the user for necessary input and compute the correct output. Programs must meet all specifications given, both in the assignment and in the rubric below. No credit will be given for programs that do not compile or run. This assignment is due 3 weeks after it is assigned. Please be careful as it is not a good idea to get too far behind and the work will build up and you will likely have a difficult time succeeding in the class. Grading is based on the following criteria: functionality, error-proofing/exception handling. efficient use of course concepts, documentation, and readability in addition to test case results. All programming exercises must include your name at the top of all programs submitted, or you will not receive credit. Note: The question has previously arisen whether you were allowed to use the algorithm and vector header files in your solutions. I think it shows more understanding for our purposes in this class if you do not use the algorithm header (since we are trying to study the details of algorithms). I think it's fine to use vector as long as the algorithm does not specify arrays. If it does specify an array (explicitly or implicitly), you should stick with an array. Let me know if you have any questions.