Write a program to track all the hyper links in an HTML document. For example, in the following HTML code we find two hyper links.

<a href="research.htm">Research</a>
<a href="course.htm">Course</a>
The syntax for HTML hyperlinks is as follows.
<A HREF="resumepage.html">my resume</A>
Your program will read from stdin the HTML file, then find all the hyper links. Note that you only need to process characters in the <A ... > ... </A> tag, and nothing else. Note that the hyper link tag can be in either lower or upper cases, and you can safely assume that whatever HREF or href found in the <A ...></A> tag is a valid hyper link.

You also need to calculate the number of times each link appears, and sort all the links according to case-sensitive alphabetical order. You can use the following insertion sort to get this done. First you need two arrays to store the hyper links and the number of times a link has been found. When you find the first link, you put it into the array and set the frequency to one. When you find the next link you look into the array and try to locate the link there. If you find the link, you only need to increase the frequency. If you do not find it in the array, you need to "insert" it into the correct position in the array -- namely push some part of the array to the end by one slot to make room for the incoming link, and set its frequency to 1 since this is the first time it appears.

編寫程式以找出HTML文件中的所有超連結。例如，在以下HTML代碼中，我們找到兩個超連結。

<a href="research.htm">Research</a>
<a href="course.htm">Course</a>
The syntax for HTML hyperlinks is as follows.
<A HREF="resumepage.html">my resume</A>
您的程式將從stdin中讀取HTML文件，然後查找所有超連結。請注意，您只需要處理<A ...> ... </A>標籤中的字元，而不需要處理任何其他字元。 請注意，超連結標籤可以是小寫或大寫的情況，您可以安全地假設在<A ...> </A>標記中找到的任何HREF或href都是有效的超連結。

您還需要計算每個超連結出現的次數，並根據區分大小寫的字母順序對所有超連結進行排序。您可以使用以下插入排序來完成此操作。首先，您需要兩個陣列來存儲超連結以及超連結的查找次數。 當您找到第一個超連結時，將其放入陣列並將次數設置為1。當您找到下一個超連結時，您會查看該陣列並嘗試找到該超連結。如果找到超連結，則只需增加次數。 如果你沒有在陣列中找到它，你需要將它“插入”到陣列中的正確位置 - 即將陣列的某些部分推到末端以便為傳入超連結騰出空間，然後設置它的次數為1，因為這是它第一次出現。