Please using Templates to create the powerful function insert_sort using insertion sort algorithm that allow the main function below works perfectly: (function show_items(T *items, int size) also need to be created )

int main() { float farr[] = {1.2,6.5,8.3,9.1,5.5,2.6,4.9,3.2,7.9}; int iarr[] = {9,1,8,5,2,4,3,6,7}; char carr[]= {'a','b','d','h','g','j','c','e','f'}; string sarr[]= {"one","five","six","seven","eight","two","three","four","nine"}; insert_sort(iarr,9); cout << "Sorted integer array: "; show_items(iarr,9); cout<<endl; insert_sort(farr,9); cout << "Sorted float array: "; show_items(farr,9); cout<<endl; insert_sort(carr,9); cout << "Sorted char array: "; show_items(carr,9); cout<<endl; insert_sort(sarr,9); cout << "Sorted string array: "; show_items(sarr,9); }

Expected output:

Sorted integer array: 1 2 3 4 5 6 7 8 9 Sorted float array: 1.2 2.6 3.2 4.9 5.5 6.5 7.9 8.3 9.1 Sorted char array: a b c d e f g h j Sorted string array: eight five four nine one seven six three two

Notice: You may have 100% output, but your code matters!