1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. public int Fun (int x, int k) { int i = 0; int y= x + k; do { 19. 20. 21. 22. } if (x/2 < 2) { k = y = x; } else{ x = k 2; y = y + x; } k = x + y; i=i+1; } while (i < x); if (x < 0 && y < 0) { k = y - x; } else { k = y + x; } return k; (a) Draw a flow graph to represent the method Fun. Label the nodes (starting with A) and the outgoing edges of the decision boxes appropriately.