3.1 Case one algorithm

3.2 worked examples for case one

3.3 Case two Kovacic algorithm

3.4 Case 3 Kovacic algorithm

3.2 worked examples for case one

3.3 Case two Kovacic algorithm

3.4 Case 3 Kovacic algorithm

The following describes the algorithm for each case separately. The easiest one is for case 1, and the hardest is for case 3. Many examples will also be given at the end of the algorithm describing to show how it works.