3) Algorithm A3: substring (s, ip, len) 1. Initialize i = ip and count = 0 2. Use an array „dest‟ to hold the required substring 3. Repeat steps 4 ,5 and 6 while count

3) Algorithm A3: substring (s, ip, len)
1. Initialize i = ip and count = 0
2. Use an array „dest‟ to hold the required substring
3. Repeat steps 4 ,5 and 6 while count <>
4. dest[count] = s[i]
5. count = count +1
6. i = i + 1
7. Insert string terminator at end of dest
8. Exit


LAB TASKS
1. run the above algorithms in C/C++